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 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. Exercises in the form of numerical examples provide readers with a method of self-study or students with homework problems, and an associated web page ( www.siam.org/books/ot106/assignmentproblems.html) offers applets that readers can use to execute some of the basic algorithms as well as links to computer codes that are available online. Table of contents Preface; Chapter 1: Introduction; Chapter 2: Theoretical Foundations; Chapter 3: Bipartite Matching Algorithms; Chapter 4: Linear Sum Assignment Problem; Chapter 5: Further Results on the Linear Sum Assignment Problem; Chapter 6: Other Types of Linear Assignment Problems; Chapter 7: Quadratic Assignment Problems: Formulations and Bounds; Chapter 8: Quadratic Assignment Problems: Algorithms; Chapter 9: Other Types of Quadratic Assignment Problems; Chapter 10: Multi-index Assignment Problems; Bibliography; Author Index; Subject Index For more information please check http://www.ec-securehost.com/SIAM/OT106.html
No earlier referenced papers in the catalog yet.
Click a node to pin it, click the empty canvas to go back to this paper, or hover to preview. Open a node’s page from its title.