Assignment Problems

Inbunden, Engelska, 2012

1 518 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2012-03-30
Mått:152 x 229 x 27 mm
Vikt:896 g
Format:Inbunden
Språk:Engelska
Antal sidor:415
Upplaga:2
Förlag:Society for Industrial & Applied Mathematics,U.S.
ISBN:9781611972221

Utforska kategorier

Mer om författaren

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.

Innehållsförteckning

PrefaceChapter 1: IntroductionChapter 2: Theoretical FoundationsChapter 3: Bipartite Matching AlgorithmsChapter 4: Linear Sum Assignment Problem: Sequential AlgorithmsChapter 5: Further Results on the Linear Sum Assignment ProblemChapter 6: Other Types of Linear Assignment ProblemsChapter 7: Quadratic Assignment Problems: Formulations and BoundsChapter 8: Quadratic Assignment Problems: AlgorithmsChapter 9: Other Types of Quadratic Assignment ProblemsChapter 10: Multi-index Assignment ProblemsBibliographyAuthor IndexSubject Index.