In this chapter we have described the state of the art in solving the Generalized Assignment Problem, as well as many extensions thereof. The approach we have taken is to generalize the GAP to a much larger class of Convex Assignment Problems, show that many of the extensions of the GAP proposed in the literature are members of this class, and describe many of the proposed solution approaches to the GAP in terms of the larger class of problems. Throughout the chapter we have paid particular attention to the Generalized Assignment Problem, the Multi-Resource Generalized Assignment Problem, and the Multi-Period Single-Sourcing Problem.
|Title of host publication||Handbook of Combinatorial Optimization : Supplement Volume B|
|Editors||Ding-Zhu Du, Panos M Pardalos|
|Place of Publication||Boston, MA|
|Publication status||Published - 2005|