Table of Contents

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.

Promotional Information

A comprehensive guide to practical and theoretic aspects of assignment problems, suitable for researchers and practitioners.

About the Author

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. Mauro Dell'Amico is a Professor of Operations Research at the University of Modena and Reggio Emilia, Italy. His research interests are combinatorial optimisation as applied to transportation, telecommunications, routing and scheduling. Silvano Martello is a Professor of Operations Research at the University of Bologna, Italy. He is author of Knapsack Problems: Algorithms and Computer Implementations (1990) and Editor-in-Chief of 4OR: A Quarterly Journal of Operations Research. His research focus is the design of algorithms for combinatorial optimisation and graph theory problems and their application in packing, routing and scheduling.