任务分配问题是组合优化里面的一类基本问题。本书系统讲解了该问题从1920年代的萌芽阶段到近代的理论、算法、以及实现的发展。章节之间具备较大独立性，方便读者不按照顺序研读。-This book provides a comprehensive treatment of assignment problems　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　 some of the basic algorithms as well as links to computer codes that are available online.



Audience: Assignment Problems is a useful tool for researchers, practitioners, and graduate students. Researchers will benefit　the detailed exposition of