The Generalized Assignment Problem and Extensions

Dolores Romero Morales () and H. Edwin Romeijn ()
Additional contact information
Dolores Romero Morales: University of Oxford, Saïd Business School
H. Edwin Romeijn: University of Florida, Department of Industrial and Systems Engineering

A chapter in Handbook of Combinatorial Optimization, 2004, pp 259-311 from Springer

Abstract: 10 Concluding Remarks 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.

Keywords: Problem Instance; Assignment Problem; Capacity Constraint; Knapsack Problem; Greedy Randomize Adaptive Search Procedure (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-23830-2_6

Ordering information: This item can be ordered from
http://www.springer.com/9780387238302

DOI: 10.1007/0-387-23830-1_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().