The QAP-polytope and the star transformation

Discrete Applied Mathematics

Volumn 111, Issue 3, 2001, Pages 283-306

  Jünger, Michael ^a   Kaibel, Volker ^b  

^a UNIVERSITY OF COLOGNE   (Germany)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

90C09; 90C10; 90C27; Polyhedral combinatorics; QAP polytope; Quadratic assignment problem

Indexed keywords

EID: 0035427047     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00272-9     Document Type: Article

References (15)

1. W.P. Adams, T.A. Johnson, Improved linear programming-based lower bounds for the quadratic assignment problem, in: P.M. Pardalos, H. Wolkowicz (Eds.), Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1994, pp. 43-75.
2. Balinski M.L., Russakoff A. On the assignment polytope. SIAM Rev. 16:1974;516-525.
3. Barahona F., Mahjoub A.R. On the cut polytope. Math. Programming. 36:1986;157-173.
4. Barvinok A.I. Combinatorial complexity of orbits in representations of the symmetric group. Adv. Soviet Math. 9:1992;161-182.
5. De Simone C. The cut polytope and the boolean quadric polytope. Discrete Math. 79:1989;71-75.
6. Drezner Z. Lower bounds based on linear programming for the quadratic assignment problem. Comput. Optim. Appl. 4(2):1995;159-165.
7. Gilmore P.C. Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM J. Appl. Math. 10:1962;305-313.
8. T.A. Johnson, New linear-programming based solution procedures for the quadratic assignment problem, Ph.D. Thesis, Graduate School of Clemson University, 1992.
9. M. Jünger, V. Kaibel, A basic study of the QAP-Polytope, Technical Report 96.215, Angewandte Mathematik und Informatik, Universität zu Köln, 1996.
10. Koopmans T.C., Beckmann M.J. Assignment problems and the location of economic activities. Econometrica. 25:1957;53-76.
11. Lawler E.L. The quadratic assignment problem. Management Sci. 9:1963;586-599.
12. Padberg M. The boolean quadric polytope: some characteristics and facets. Math. Programming. 45-1:1989;139-172.
13. Padberg M., Rijal M.P. Location, Scheduling, Design and Integer Programming. 1996;Kluwer Academic Publishers, Dordrecht.
14. Resende M.G.C., Ramakrishnan K.G., Drezner Z. Computing lower bounds for the quadratic assignment problem with an interior point solver for linear programming. Oper. Res. 43:1995;781-791.
15. M.P. Rijal, Scheduling, design and assignment problems with quadratic costs, Ph.D. Thesis, New York University, 1995.