AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Quadratic Assignment and Related Problems
About this Title
Panos Pardalos, University of Florida, Gainesville, FL and Henry Wolkowicz, University of Waterloo, Waterloo, ON, Canada, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1994; Volume 16
ISBNs: 978-0-8218-6607-8 (print); 978-1-4704-3974-3 (online)
DOI: https://doi.org/10.1090/dimacs/016
MathSciNet review: MR1290344
MSC: Primary 90-06; Secondary 90C27, 90C30, 90C35
Table of Contents
Front/Back Matter
Chapters
- The quadratic assignment problem: A survey and recent developments
- Improved linear programming-based lower bounds for the quadratic assignment problem
- Advanced search techniques for circuit partitioning
- A genetic algorithm for a special class of the quadratic assignment problem
- On the biquadratic assignment problem
- A reformulation scheme and new lower bounds for the QAP
- A constructive method to improve lower bounds for the quadratic assignment problem
- Genetic hybrids for the quadratic assignment problem
- Domination & separation applied to the quadratic assignment problem
- Trust regions and relaxations for the quadratic assignment problem
- Stochastic quadratic assignment problems
- A greedy randomized adaptive search procedure for the quadratic assignment problem
- Difficulties of exact methods for solving the quadratic assignment problem
- Using QAP bounds for the circulant TSP to design reconfigurable networks
- Approximation of association data by structures and clusters
- Partitioning multiple data sets: Multidimensional assignments and Lagrangian relaxation
- A quadratic partial assignment and packing model and algorithm for the airline gate assignment problem