This revised reprint replaces Assignment Problems (Order Code OT106, ISBN 978-0-898716-63-4), which is no longer available.
2012 / xxii + 393 / Hardcover / ISBN 978-1-611972-22-1 / List Price $117.00 / SIAM Member Price $81.90 / Order Code OTR106
Keywords: combinatorial optimization, linear assignment, quadratic assignment, matching, algorithms
SIREV Book Review
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 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. 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. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems, and many variations of these problems. Exercises in the form of numerical examples provide readers with a method of self-study or students with homework problems, and an associated webpage offers applets that readers can use to execute some of the basic algorithms as well as links to computer codes that are available online.
Researchers will benefit from the book's detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its many 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 discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science.
About the Author
Rainer Burkard is a Professor Emeritus of Mathematics at Graz University of Technology, Austria. He has published several books and over 150 papers on discrete optimization and related areas, and he serves as an editor for numerous journals in discrete applied mathematics. His main research focus is combinatorial optimization 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 optimization 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 (Wiley, 1990) and Editor-in-Chief of 4OR:A Quarterly Journal of Operations Research. His research focus is the design of algorithms for combinatorial optimization and graph theory problems and their application in packing, routing, and scheduling.
This product hasn't received any reviews yet. Be the first to review this product!
All prices are in USD