Assignment problems

摘要: This book provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organized into 10 self-contained chapters to make it easy for readers use specific interest them without having read linearly. topics covered include bipartite matching algorithms, linear problems, quadratic multi-index many variations these problems. Exercises form numerical examples provide with method self-study or students homework an associated webpage offers applets that can execute some basic algorithms as well links computer codes are available online. Audience: Assignment Problems is useful tool researchers, practitioners, graduate students. Researchers will benefit detailed exposition theory related including sum problem its variations. Practitioners learn about applications methods, performance exact heuristic software options. also serve text advanced courses discrete mathematics, integer programming, combinatorial optimization, algorithmic science. Contents: Preface; Chapter 1: Introduction; 2: Theoretical Foundations; 3: Bipartite Matching Algorithms; 4: Linear Sum Problem; 5: Further Results on 6: Other Types Problems; 7: Quadratic Problems: Formulations Bounds; 8: 9: 10: Multi-index Bibliography; Author Index; Subject Index