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.
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.
Auflage
Sprache
Verlagsort
Zielgruppe
Editions-Typ
Produkt-Hinweis
Fadenheftung
Gewebe-Einband
Maße
Höhe: 261 mm
Breite: 182 mm
Dicke: 27 mm
Gewicht
ISBN-13
978-1-61197-222-1 (9781611972221)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
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.
Preface
Chapter 1: Introduction
Chapter 2: Theoretical Foundations
Chapter 3: Bipartite Matching Algorithms
Chapter 4: Linear Sum Assignment Problem: Sequential Algorithms
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.
