ASSIGNMENT PROBLEMS REVISED REPRINT

Assignment Problems is a useful tool for researchers, practitioners and graduate students. In 10 self-contained chapters, it provides a comprehensive treatment of assignment problems from their conceptual beginnings through present-day theoretical, algorithmic and practical developments. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems and many variations of these. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its variations. Practitioners will learn about practical applications of the methods, the performance of exact and heuristic algorithms, and software options. This book also can serve as a text for advanced courses in areas related to discrete mathematics and combinatorial optimisation. The revised reprint provides details on a recent discovery related to one of Jacobi's results, new material on inverse assignment problems and quadratic assignment problems, and an updated bibliography.

Preface; 1. Introduction; 2. Theoretical foundations; 3. Bipartite matching algorithms; 4. Linear sum assignment problem: sequential algorithms; 5. Further results on the linear sum assignment problem; 6. Other types of linear assignment problems; 7. Quadratic assignment problems: formulations and bounds; 8. Quadratic assignment problems: algorithms; 9. Other types of quadratic assignment problems; 10. Multi-index assignment problems; Bibliography; Author index; Subject index.

A comprehensive treatment of assignment problems from their beginnings through present-day theoretical, algorithmic and practical developments. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, and practitioners will learn about applications of the methods. This revised reprint includes new material and an updated bibliography.