An algorithm for the generation of cuts for the problem of quadratic assignment;Un algorithme de génération de coupes pour le problème de l'affectation quadratique

INFOR

Volumn 41, Issue 1, 2003, Pages 35-49

  Blanchard, Aurélien ^a   Elloumi, Sourour ^b   Faye, Alain ^c   Wicker, Nicolas ^d  

^a SOCIÉTÉ GÉNÉRALE   (France)

^b Bioinformatique et Chimie Moléculaire   (France)

^c IIE   (France)

^d INSTITUT DE GÉNÉTIQUE ET DE BIOLOGIE MOLÉCULAIRE ET CELLULAIRE   (France)

Author keywords

Cutting plane algorithm; Facets; Linearization; Quadratic assignment

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; LINEARIZATION; NONLINEAR PROGRAMMING;

POLYHEDRAL METHOD;

INFORMATION SCIENCE;

EID: 0242611664     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.1080/03155986.2003.11732667     Document Type: Article

References (20)

1. W.P. Adams, T. A. Johnson. Improved Linear Programming-Based Lower Bounds for the Quadratic Assignment Problem. DIMACS Series in Discrete Mathematics and Theorical Computer Science 16 (1994) 43-75.
2. W.P. Adams, H.D. Sherali. A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems. Management Science 32 n°10 (1986) 1274-1290.
3. A.A. Assad, W. Xu. On Lower Bounds for a Class of Quadratic 0-1 Programs. Operations Research Letters 4 n°4 (1985) 175-180.
4. M.S. Bazaraa, H.D. Sherali. Benders' Partitioning Scheme Applied to a New Formulation of the Quadratic Assignment Problem. Naval Research Logistics Quaterly 27 (1980) 29-41.
5. A. Billionnet, S. Elloumi, A. Faye. The Quadratic Assignment Polytope. Rapport de recherche CNAM (1997). http://cedric.cnam.fr/AfficheArticle.php?id=381
6. A. Blanchard. Algorithme de génération de coupes pour l'affectation quadratique. Rapport de stage 1ère année I.I.E., Evry (1998).
7. A. Blanchard, S. Elloumi, A. Faye, N. Wicker. Une famille de facettes pour le polytope de l' affectation quadratique. Rapport de recherche CNAM (2002). http://cedric.cnam.fr/AfficheArticle.php?id=330
8. E. Burkard, T. Bönniger. A Heuristic for Quadratic Boolean Programs with Applications to Quadratic Assignment Problems. European Journal of Operational Research 13 (1983) 374-386.
9. R.E. Burkard, S.E. Karisch, F. Rendl. Quadratic Assignment Problem Library. European Journal of Operational Research, 55 115-119 (1991).
10. N. Christofides, A. Mingozzi, P. Toth. Contributions to the Quadratic Assignment Problem. European Journal of Operational Research 4 (1980) 243-247.
11. A.M. Frieze, J. Yadegar. On the Quadratic Assignment Problem. Discrete Applied Mathematics 5 (1983) 89-98.
12. M.R Garey, D.S Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Compagny (1979).
13. S.E. Karisch. Nonlinear Approaches for Quadratic Assignment and Graph Partition Problems. Report 301-CDLDO 54, Christian Doppler Laboratorium für Diskrete Optimierung, Technische Universität Graz, Institut für Mathematik (September 1995).
14. L. Kaufman, F. Broeckx. An Algorithm for the Quadratic Assignment Problem using Benders' Decomposition. European Journal of Operational Research 2 (1978) 207-211.
15. E.L. Lawler. The Quadratic Assignment Problem. Management Science 9 (1963) 586-599.
16. G.L. Nemhauser, L.A. Wolsey: Integer and Combinatorial Optimization. Wiley Interscience (1988).
17. M.W. Padberg, M.P. Rijal. Location, Sheduling, Design and Integer Programming, Chapter 7 Quadratic Assignment Polytopes. Kluwer Academic Publishers (1996).
18. P.M. Pardalos, F. Rendl, H. Wolkowicz, The Quadratic Assignment Problem: A Survey and Recent Developments. DIMACS Series in Discrete Mathematics and Theorical Computer Science 16 (1994) 1-32.
19. M.G.C. Resende, K.G. Ramakrishnan, Z. Drezner. Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming. Operations Research Vol.43, n°5, September-October (1995) 781-791.
20. N. Wicker. Affectation quadratique et méthodes polyédriques. Mémoire d'ingénieur IIE et DEA d'IRO IIE-CNAM-ParisVI, Evry (1999).