Polyhedral combinatorics of quadratic assignment problems with less objects than locations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1412, Issue , 1998, Pages 409-422

  Kaibel, Volker ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; LOCATION; TOPOLOGY;

CUTTING PLANES; FACET-DEFINING INEQUALITIES; HARD INSTANCES; LOWER BOUNDS; OPTIMAL SOLUTIONS; POLYHEDRAL COMBINATORICS; POLYHEDRAL STUDIES; QUADRATIC ASSIGNMENT PROBLEMS;

INTEGER PROGRAMMING;

EID: 84946550461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69346-7_31     Document Type: Conference Paper

References (14)

1. A. Brüngger, A. Marzetta, J. Clausen, and M. Perregaard. Joining forces in solving large-scale quadratic assignment problems. In Proceedings of the 11th International Parallel Processing Symposium IPPS, pages 418-427, 1997.
2. R. E. Burkard, S. E. Karisch, and F. Rendl. QAPLIB-A quadratic assignment problem library. Journal of Global Optimization, 10:391-403, 1997.
3. J. Clausen and M. Perregaard. Solving large quadratic assignment problems in parallel. Computational Optimization and Applications, 8(2):111-127, 1997.
4. M. Jünger and V. Kaibel. On the SQAP-polytope. Technical Report 96.241, Angewandte Mathematik und Informatik, Universität zu Köln, 1996.
5. M. Jünger and V. Kaibel. Box-inequalities for quadratic assignment polytopes. Technical Report 97.285, Angewandte Mathematik und Informatik, Universität zu Köln, 1997.
6. M. Jünger and V. Kaibel. The QAP-polytope and the star-transformation. Technical Report 97.284, Angewandte Mathematik und Informatik, Universität zu Köln, 1997.
7. M. Jünger and S. Thienel. Introduction to ABACUS-A Branch-And-CUt System. Technical Report 97.263, Angewandte Mathematik und Informatik, Universität zu Köln, 1997. (To appear in OR Letters).
8. V. Kaibel. Polyhedral Combinatorics of the Quadratic Assignment Problem. PhD thesis, Universität zu Köln, 1997. http://www.informatik.uni-koeln.de/lsjuenger/staff/kaibel/diss.html.
9. S. E. Karisch and F. Rendl. Lower bounds for the quadratic assignment problem via triangle decompositions. Mathematical Programming, 71(2):137-152, 1995.
10. T. C. Koopmans and M. J. Beckmann. Assignment problems and the location of economic activities. Econometrica, 25:53-76, 1957.
11. M. Padberg and M. P. Rijal. Location, Scheduling, Design and Integer Program-ming. Kluwer Academic Publishers, 1996.
12. M. G. C. Resende, K. G. Ramakrishnan, and Z. Drezner. Computing lower bounds for the quadratic assignment problem with an interior point solver for linear programming. Operations Research, 43:781-791, 1995.
13. M. P. Rijal. Scheduling, Design and Assignment Problems with Quadratic Costs. PhD thesis, New York University, 1995.
14. S. Sahni and T. Gonzales. P-complete approximation problems. Journal of the Association for Computing Machinery, 1976.