On the SQAP-polytope

SIAM Journal on Optimization

Volumn 11, Issue 2, 2000, Pages 444-463

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

^a UNIVERSITY OF COLOGNE   (Germany)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Polyhedral combinatorics; Quadratic assignment problem; Symmetric model

Indexed keywords

EID: 0034353732     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623496310576     Document Type: Article

References (24)

1. W. P. ADAMS AND T. A. JOHNSON, Improved linear programming-based lower bounds for the quadratic assignment problem, in Quadratic Assignment and Related Problems, P. M. Pardalos and H. Wolkowicz, eds., DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 16, 1994, pp. 43-75.
2. W. P. ADAMS AND H. D. SHERALI, A tight linearization and an algorithm for zero-one quadratic programming problems, Management Sci., 32 (1986), pp. 1274-1290.
3. M. BALINSKI, On a selection problem, Management Sci., 17 (1970), pp. 230-231.
4. M. L. BALINSKI AND A. RUSSAKOFF, On the assignment polytope, SIAM Rev., 16 (1974), pp. 516-525.
5. A. I. BARVINOK, Combinatorial complexity of orbits in representations of the symmetric group, Adv. Soviet Math., 9 (1992), pp. 161-182.
6. N. W. BRIXIUS AND K. M. ANSTREICHER, Solving Quadratic Assignment Problems Using Convex Quadratic Programming Relaxations, tech. report, Dept. of Computer Science, University of Iowa, Iowa City, IA, 2000.
7. R. BURKARD, S. KARISCH, AND F. RENDL, QAPLIB - A quadratic assignment problem library, J. Global Optim., 10 (1997), pp. 391-403.
8. J. CLAUSEN AND M. PERREGAARD, Solving large quadratic assignment problems in parallel, Comput. Optim. Appl., 8 (1997), pp. 111-127.
9. A. M. FRIEZE AND J. YADEGAR, On the quadratic assignment problem, Discrete Appl. Math., 5 (1983), pp. 89-98.
10. P. GILMORE, Optimal and suboptimal algorithms for the quadratic assignment problem, J. Soc. Indust. Appl. Math., 10 (1962), pp. 305-313.
11. P. HAHN AND T. GRANT, Lower bounds for the quadratic assignment problem based upon a dual formulation, Oper. Res., 46 (1998), pp. 912-922.
12. P. HAHN, T. GRANT, AND N. HALL, A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method, Eur. J. Oper. Res., 108 (1998), pp. 629-640.
13. T. JOHNSON, New Linear-Programming Based Solution Procedures for the Quadratic Assignment Problem, Ph.D. dissertation, Clemson University, Clemson, SC, 1992.
14. M. JÜNGER AND V. KAIBEL, A Basic Study of the QAP-Polytope, tech. report 96.215, Angewandte Mathematik und Informatik, Universität zu Köln, Köln, Germany, 1996.
15. M. JÜNGER AND V. KAIBEL, Box-Inequalities for Quadratic Assignment Polytopes, tech. report 97.285, Angewandte Mathematik und Informatik, Universität zu Köln, Köln, Germany, 1997. Math. Program., submitted.
16. M. JÜNGER AND V. KAIBEL,The QAP-Polytope and the Star-Transformation, tech. report 97.284, Angewandte Mathematik und Informatik, Universität zu Köln, Köln, Germany, 1997. Discrete Appl. Math., to appear.
17. V. KAIBEL, Polyhedral Combinatorics of the Quadratic Assignment Polytope, Ph.D. thesis, Universität zu Köln, Köln, Germany, 1997.
18. V. KAIBEL, Polyhedral combinatorics of QAPs with less objects than locations, R. E. Bixby, E. A. Boyd, and R. Z. Ríos-Mercado, eds., Lecture Notes in Comput. Sci. 1412, Springer-Verlag, Berlin, 1998, pp. 409-422.
19. T. KOOPMANS AND M. BECKMANN, Assignment problems and the location of economic activities, Econometrica, 25 (1957), pp. 53-76.
20. E. LAWLER, The quadratic assignment problem, Management Sci., 9 (1963), pp. 586-599.
21. M. PADBERG AND M. RIJAL, Location, Scheduling, Design and Integer Programming, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1996.
22. M. RESENDE, K. RAMAKRISHNAN, AND Z. DREZNER, Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming, Oper. Res., 43 (1995), pp. 781-791.
23. J. RHYS, A selection problem of shared fixed costs and networks, Management Sci., 17 (1970), pp. 207-207.
24. M. RIJAL, Scheduling, Design and Assignment Problems with Quadratic Costs, Ph.D. dissertation, New York University, New York, 1995.