Decomposition and Linearization for 0-1 Quadratic Programming

Annals of Operations Research

Volumn 99, Issue 1-4, 2000, Pages 79-93

  Elloumi, Sourour ^a   Faye, Alain ^b   Soutif, Eric ^b  

^a CEDRIC CNAM   (France)

^b CEDRIC IIE   (France)

Author keywords

Lagrangian decomposition; Linearization; Mixed integer programming; Quadratic 0 1 programming

Indexed keywords

EID: 0034562988     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1019236832495     Document Type: Article

References (18)

1. E. Balas and J.B. Mazzola, Non-linear 0-1 programming I: Linearization techniques, Mathematical Programming 30 (1984) 1-21.
2. E. Balas and J.B. Mazzola, Non-linear 0-1 programming II: Dominance relation and algorithms, Mathematical Programming 30 (1984) 22-45.
3. A. Billionnet and F. Calmels, Linear programming for the 0-1 quadratic knapsack problem, EJOR 92 (1996) 310-325.
4. A. Billionnet, A. Faye and E. Soutif, A new upper bound for the 0-1 quadratic knapsack problem, EJOR 112 (1999) 664-672.
5. P. Chardaire and A. Sutter, A decomposition method for quadratic zero-one programming, Management Science 41(4) (1995) 704-712.
6. CPLEX, CPLEX User's Guide (CPLEX Optimization, Incline Village, NV, 1995).
7. 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).
8. M.R. Garey and D.S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness (Freeman, 1979).
9. A.M. Geoffrion, Lagrangian relaxation for integer programming, Mathematical Programming Study 2 (1974) 81-114.
10. F. Glover and E. Wolsey, Converting the 0-1 polynomial programming problem to a linear 0-1 program, Operations Research 22 (1974) 180-182.
11. F. Granot and P.L. Hammer, On the use of Boolean functions in 0-1 programming, Methods of Operations Research 12 (1971) 154-184.
12. M. Guignard and S. Kim, Lagrangian decomposition for integer programming: Theory and applications, RAIRO Recherche Opérationnelle 21(4) (1987) 307-323.
13. P. Michelon and N. Maculan, Lagrangian decomposition for integer nonlinear programming with linear constraints, Mathematical Programming 52 (1991) 303-313.
14. 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.
15. D.J. Rader Jr. and P.L. Hammer, Efficient methods for solving quadratic 0-1 knapsack problems, INFOR 35(3) (1997) 170-182.
16. 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.
17. 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.
18. H.D. Sherali and W.P. Adams, A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems, Discrete Applied Mathematics 52 (1994) 83-106.