Print

The Generalized Assignment Problem and Extensions

Publication: Research - peer-reviewBook chapter

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.

Publication information

Original languageEnglish
Title of host publicationHandbook of Combinatorial Optimization : Supplement Volume B
EditorsDing-Zhu Du, Panos M Pardalos
VolumeB
Place of PublicationBoston, MA
PublisherSpringer
Publication date2005
Pages259-311
ISBN (print)9780387238296
ISBN (electronic)9780387238302
DOIs
StatePublished - 2005
Externally publishedYes

ID: 40951748