New Titles  |  FAQ  |  Keep Informed  |  Review Cart  |  Contact Us Quick Search (Advanced Search ) Browse by Subject General Interest Logic & Foundations Number Theory Algebra & Algebraic Geometry Discrete Math & Combinatorics Analysis Differential Equations Geometry & Topology Probability & Statistics Applications Mathematical Physics Math Education

Quadratic Assignment and Related Problems
Edited by: Panos M. Pardalos and Henry Wolkowicz
A co-publication of the AMS and DIMACS.
 SEARCH THIS BOOK:
DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
1994; 364 pp; hardcover
Volume: 16
ISBN-10: 0-8218-6607-9
ISBN-13: 978-0-8218-6607-8
List Price: US$89 Member Price: US$71.20
Order Code: DIMACS/16

This book, the first dedicated to quadratic assignment problems, contains refereed papers presented at the Workshop on Quadratic Assignment and Related Problems, held at DIMACS in May 1993. Bringing together researchers from academia and industry, the workshop focused on recent computational approaches and applications. The methods described here include eigenvalue estimates and reduction techniques for lower bounds, parallelization, genetic algorithms, polyhedral approaches, greedy and adaptive search algorithms. The applications include graph bandwidth problems, telecommunications network design, load balancing, VLSI design, data association problems, and multidimensional assignment problems. In addition, this book contains a survey article with an extensive bibliography.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM).

Graduate students and researchers in mathematics, engineering, operations research, economics, management science and computer science.

Reviews

"This volume [is] a valuable source on QAPs."

-- Journal of Global Optimization

"The quality of this set of papers shows an overall high standard ... a definite must for any library in mathematics and business where operation plays a significant role ... the individual researcher dealing with the quadratic assignment problem has no chance to be up to date with respect to QAP unless this book has been read ... an overall excellently prepared up to date overview on the quadratic assignment problem."

-- OR Spektrum

• P. M. Pardalos, F. Rendl, and H. Wolkowicz -- The quadratic assignment problem: A survey and recent developments
• W. Adams and T. A. Johnson -- Improved linear programming-based lower bounds for the quadratic assignment problem
• S. Areibi and A. Vannelli -- Advanced search techniques for circuit partitioning
• T. N. Bui and B. R. Moon -- A genetic algorithm for a special class of the quadratic assignment problem
• R. E. Burkard, E. Çela, and B. Klinz -- On the biquadratic assignment problem
• P. Carraresi and F. Malucelli -- A reformulation scheme and new lower bounds for the QAP
• J. Chakrapani and J. Skorin-Kapov -- A constructive method to improve lower bounds for the quadratic assignment problem
• C. Fleurent and J. A. Ferland -- Genetic hybrids for the quadratic assignment problem
• S. W. Hadley -- Domination & separation applied to the quadratic assignment problem
• S. E. Karisch, F. Rendl, and H. Wolkowicz -- Trust regions and relaxations for the quadratic assignment problem
• W.-J. Li and J. M. Smith -- Stochastic quadratic assignment problems
• Y. Li, P. M. Pardalos, and M. G. C. Resende -- A greedy randomized adaptive search procedure for the quadratic assignment problem
• T. Mautor and C. Roucairol -- Difficulties of exact methods for solving the quadratic assignment problem
• E. Medova -- Using QAP bounds for the circulant TSP to design reconfigurable networks
• B. Mirkin -- Approximation of association data by structures and clusters
• A. B. Poore and N. Rijavec -- Partitioning multiple data sets: multidimensional assignments and lagrangian relaxation
• H. D. Sherali and E. L. Brown -- A quadratic partial assignment and packing model and algorithm for the airline gate assignment problem
 AMS Home | Comments: webmaster@ams.org © Copyright 2014, American Mathematical Society Privacy Statement