(Mixed) Integer Linear Programming – Page 76

Solving Large Quadratic Assignment Problems on Computational Grids

Published: 2000/10/27, Updated: 2000/10/31

(Mixed) Integer Linear Programming, Combinatorial Optimization, Parallel Algorithms

The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of size n >= 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful computational platforms. In this article we describe a novel approach to solve QAPs using … Read more

On the Value of Binary Expansions For General Mixed-Integer Linear Programs

Published: 2000/10/20, Updated: 2001/05/20

(Mixed) Integer Linear Programming, Optimization Software and Modeling Systems mixed-integer programming

We study the use of binary variables in reformulating general mixed-integer linear programs. We show that binary reformulations result in problems for which almost all the binary variables replacing a general integer variable need to be explored during branching. We also give computational results on the performance of such reformulations in solving the mixed-integer programs, … Read more