A comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organised the book into 10 self-contained chapters to make it easy for readers to use the specific chapters of interest to them without having to read the book linearly.
A comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organised the book into 10 self-contained chapters to make it easy for readers to use the specific chapters of interest to them without having to read the book linearly.
Rainer Burkard is Professor Emeritus of Mathematics at Graz University of Technology, Austria. He has published several books and over 150 papers on discrete optimisation and related areas. His main research focus is combinatorial optimisation and its applications.
Inhaltsangabe
1. Preface 2. Chapter 1: Introduction 3. Chapter 2: Theoretical Foundations 4. Chapter 3: Bipartite Matching Algorithms 5. Chapter 4: Linear Sum Assignment Problem: Sequential Algorithms 6. Chapter 5: Further Results on the Linear Sum Assignment Problem 7. Chapter 6: Other Types of Linear Assignment Problems 8. Chapter 7: Quadratic Assignment Problems: Formulations and Bounds 9. Chapter 8: Quadratic Assignment Problems: Algorithms 10. Chapter 9: Other Types of Quadratic Assignment Problems 11. Chapter 10: Multi-index Assignment Problems 12. Bibliography 13. Author Index 14. Subject Index.