Constrained 0-1 quadratic programming: Basic approaches and extensions

Abstract We describe the simplest technique to tackle 0–1 Quadratic Programs with linear constraints among those that turn out to be successful in practice. This method is due to and familiar to the Quadratic Assignment experts, even if it took some time to realize that most approaches to the problem could be interpreted in these terms, whereas it does not appear to be widely known outside this community. Since the technique is completely general and is by far the most successful one in several other cases, such as Quadratic Knapsack, we illustrate it in its full generality, pointing out its relationship to Lagrangian and linear programming relaxations and discussing further extensions. We believe that this method should be in the background of every practitioner in Combinatorial Optimization.

[1]  Antonio Sassano,et al.  A Lagrangian-based heuristic for large-scale set covering problems , 1998, Math. Program..

[2]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[3]  Caterina De Simone,et al.  The cut polytope and the Boolean quadric polytope , 1990, Discret. Math..

[4]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[5]  Paolo Toth,et al.  Exact Solution of the Quadratic Knapsack Problem , 1999, INFORMS J. Comput..

[6]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[7]  P. Hammer,et al.  Quadratic knapsack problems , 1980 .

[8]  Alberto Caprara,et al.  Structural alignment of large—size proteins via lagrangian relaxation , 2002, RECOMB '02.

[9]  Federico Malucelli,et al.  A Reformulation Scheme and New Lower Bounds for the QAP , 1993, Quadratic Assignment and Related Problems.

[10]  K. G. Ramakrishnan,et al.  Tight QAP bounds via linear programming , 2002 .

[11]  Robert D. Carr,et al.  101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem , 2001, RECOMB.

[12]  Warren P. Adams,et al.  A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems , 1986 .

[13]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[14]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[15]  P. L. Ivanescu.  Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .

[16]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[17]  P. Gilmore.  Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[18]  Alain Billionnet,et al.  Linear programming for the 0–1 quadratic knapsack problem , 1996 .

[19]  David Pisinger,et al.  Upper bounds and exact algorithms for p-dispersion problems , 2006, Comput. Oper. Res..

[20]  P. Pardalos,et al.  Combinatorial and Global Optimization , 2002 .

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  V. Deineko,et al.  The Quadratic Assignment Problem: Theory and Algorithms , 1998 .

[23]  Pierre Hansen,et al.  Roof duality, complementation and persistency in quadratic 0–1 optimization , 1984, Math. Program..

[24]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[25]  Zvi Drezner,et al.  Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming , 1995, Oper. Res..

[26]  Warren P. Adams,et al.  Improved Linear Programming-based Lower Bounds for the Quadratic Assignment Proglem , 1993, Quadratic Assignment and Related Problems.

[27]  Monique Guignard-Spielberg,et al.  A level-2 reformulation-linearization technique bound for the quadratic assignment problem , 2007, Eur. J. Oper. Res..