A dynamic-programming bound for the quadratic assignment problem

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

Volumn 1627, Issue , 1999, Pages 339-348

  Marzetta, Ambros ^a   Brüngger, Adrian ^b  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b NOVARTIS PHARMA AG   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

ALGORITHM FOR SOLVING; NP COMPLETE; OPTIMIZATION PROBLEMS; PROBLEM SIZE; PROGRAMMING PARADIGMS; QUADRATIC ASSIGNMENT PROBLEMS; SEARCH TREES; SUB-PROBLEMS;

DYNAMIC PROGRAMMING;

EID: 84957805380     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48686-0_34     Document Type: Conference Paper

References (9)

1. Adrian Brüngger. Solving Hard Combinatorial Optimization Problems in Parallel: Two Case Studies. PhD thesis, ETH Zürich, 1997.
2. Adrian Brüngger, Ambros Marzetta, Jens Clausen, and Michael Perregaard. Solving large-scale QAP problems in parallel with the search library ZRAM. Journal of Parallel and Distributed Computing, 50:157-169, 1998. http://wwwjn.inf.ethz.ch/ambros/zram/jpdc_qap.pdf.
3. Adrian Brüngger, Ambros Marzetta, Komei Fukuda, and Jürg Nievergelt. The parallel search bench ZRAM and its applications. Annals of Operations Research. to appear; http://wwwjn.inf.ethz.ch/ambros/aor_zram.ps.gz.
4. Rainer E. Burkard, Stefan E. Karisch, and Franz Rendl. QAPLIB-a quadratic assignment problem library. Journal of Global Optimization, 10:391-403, 1997. http://serv1.imm.dtu.dk/~sk/qaplib/.
5. Eranda Çela. The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers, 1998.
6. Jens Clausen, Stefan E. Karisch, Michael Perregaard, and Franz Rendl. On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel. Computational Optimization and Applications, 10:127-147, 1998. http://serv1.imm.dtu.dk/~sk/diku2496.ps.
7. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
8. Ambros Marzetta. ZRAM: A Library of Parallel Search Algorithms and Its Use in Enumeration and Combinatorial Optimization. PhD thesis, ETH Zürich, 1998. http://www.inf.ethz.ch/publications/diss.html.
9. P. Pardalos and H. Wolkowicz, editors. Quadratic Assignment and Related Problems, volume 16 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1993.