Hardcover ISBN:  9780821866078 
Product Code:  DIMACS/16 
List Price:  $100.00 
MAA Member Price:  $90.00 
AMS Member Price:  $80.00 
Electronic ISBN:  9781470439743 
Product Code:  DIMACS/16.E 
List Price:  $94.00 
MAA Member Price:  $84.60 
AMS Member Price:  $75.20 

Book DetailsDIMACS  Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 16; 1994; 364 ppMSC: Primary 90;
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.
ReadershipGraduate students and researchers in mathematics, engineering, operations research, economics, management science and computer science.

Table of Contents

Chapters

The quadratic assignment problem: A survey and recent developments

Improved linear programmingbased 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


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


Request Review Copy
 Book Details
 Table of Contents
 Reviews

 Request Review Copy
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.
Graduate students and researchers in mathematics, engineering, operations research, economics, management science and computer science.

Chapters

The quadratic assignment problem: A survey and recent developments

Improved linear programmingbased 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

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