Abstract
This paper presents a general decomposition method to compute bounds for constrained 0-1 quadratic programming. The best decomposition is found by using a Lagrangian decomposition of the problem. Moreover, in its simplest version this method is proved to give at least the bound obtained by the LP-relaxation of a non-trivial linearization. To illustrate this point, some computational results are given for the 0-1 quadratic knapsack problem.
Similar content being viewed by others
References
E. Balas and J.B. Mazzola, Non-linear 0–1 programming I: Linearization techniques, Mathematical Programming 30 (1984) 1–21.
E. Balas and J.B. Mazzola, Non-linear 0–1 programming II: Dominance relation and algorithms, Mathematical Programming 30 (1984) 22–45.
A. Billionnet and F. Calmels, Linear programming for the 0–1 quadratic knapsack problem, EJOR 92 (1996) 310–325.
A. Billionnet, A. Faye and E. Soutif, A new upper bound for the 0–1 quadratic knapsack problem, EJOR 112 (1999) 664–672.
P. Chardaire and A. Sutter, A decomposition method for quadratic zero-one programming,Management Science 41(4) (1995) 704–712.
CPLEX, CPLEX User's Guide (CPLEX Optimization, Incline Village, NV, 1995).
A. Faye, Programmation quadratique en variables bivalentes sous contraintes linéaires. Application au placement de tâches dans les systèmes distribués et à la partition de graphes, Thèse de Doctorat en Informatique, Conservatoire National des Arts et Métiers, Paris (1994).
M.R. Garey and D.S. Johnson, Computers and Intractability, a Guide to the Theory of NPCompleteness (Freeman, 1979).
A.M. Geoffrion, Lagrangian relaxation for integer programming, Mathematical Programming Study 2 (1974) 81–114.
F. Glover and E. Wolsey, Converting the 0–1 polynomial programming problem to a linear 0–1 program, Operations Research 22 (1974) 180–182.
F. Granot and P.L. Hammer, On the use of Boolean functions in 0–1 programming, Methods of Operations Research 12 (1971) 154–184.
M. Guignard and S. Kim, Lagrangian decomposition for integer programming: Theory and applications, RAIRO Recherche Opérationnelle 21(4) (1987) 307–323.
P. Michelon and N. Maculan, Lagrangian decomposition for integer nonlinear programming with linear constraints, Mathematical Programming 52 (1991) 303–313.
S. Poljak, F. Rendl and H. Wolkowicz, A recipe for semidefinite relaxation for (0,1)-quadratic programming, Journal of Global Optimization 7 (1995) 51–73.
D.J. Rader Jr. and P.L. Hammer, Efficient methods for solving quadratic 0–1 knapsack problems, INFOR 35(3) (1997) 170–182.
M.G.C. Resende, K.G. Ramakrishnan and Z. Drezner, Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming, Operations Research 43(5) (1995) 781–791.
H.D. Sherali and W.P. Adams, A tight linearization and an algorithm for zero-one quadratic programming problems, Management Science 32(10) (1986) 1274–90.
H.D. Sherali and W.P. Adams, A hierarchy of relaxations and convex hull characterizations for mixedinteger zero-one programming problems, Discrete Applied Mathematics 52 (1994) 83–106.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Elloumi, S., Faye, A. & Soutif, E. Decomposition and Linearization for 0-1 Quadratic Programming. Annals of Operations Research 99, 79–93 (2000). https://doi.org/10.1023/A:1019236832495
Issue Date:
DOI: https://doi.org/10.1023/A:1019236832495