Assignment Problems, Revised Reprint

Front Cover
SIAM, 2009 - Assignment problems - 393 pages
0 Reviews
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

OT106_ch1
1
OT106_ch2
13
OT106_ch3
35
OT106_ch4
73
OT106_ch5
145
OT106_ch6
171
OT106_ch7
205
OT106_ch8
253
OT106_ch9
287
OT106_ch10
311
OT106_bm
327
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information