Synopses & Reviews
This monograph focuses on a class of problems that in effect have yet to be solved. Location, scheduling and design problems are assignment type problems with quadratic cost functions and occur in many contexts. Applications of these problems abound in diverse disciplines, such as anthropology, archeology, architecture, chemistry, computer science, economics, electronics, ergonomics, marketing, operations management, political science, statistical physics, zoology, etc. Padberg and Rijal have taken an important step in the solution of these problems. In this monograph they classify mathematical properties for ten classes of assignment problems: Quadratic Assignment Problems, Traveling Salesman Problems, Triangulation Problems, Linear Assignment Problems, VLSI Circuit Layout Design Problems, Multi-Processor Problems, Scheduling Problems with Interaction Costs, Operation-Scheduling Problems, Graph and Clique Partitioning Problems, and Boolean Quadratic Problems. They note that before these problems can be solved computationally, one must know and understand their mathematical properties. After discussing these properties, an integer programming approach is offered for solving them. The computational approach has shown considerable algorithmic success. The heart of this monograph is the theoretical work on assignment problems and the computation results that were produced using algorithms developed at NYU. The authors conclude that implementing a proper branch-and-cut algorithm on these types of problems will push the limits of exact computation far beyond the current ones.
Table of Contents
Preface. 1. Location Problems. 2. Scheduling and Design Problems. 3. Solution Approaches. 4. Locally Ideal LP Formulations I. 5. Locally Ideal LP Formulations II. 6. Quadratic Scheduling Problems. 7. Quadratic Assignment Polytopes. 8. Solving Small QAPs. A. FORTRAN Programs for Small SQPs. References. Index.