A Branch-and-Price Algorithm for the Generalized Assignment Problem

Martin Savelsbergh
Additional contact information
Martin Savelsbergh: Georgia Institute of Technology, Atlanta, Georgia

Operations Research, 1997, vol. 45, issue 6, 831-841

Abstract: The generalized assignment problem examines the maximum profit assignment of jobs to agents such that each job is assigned to precisely one agent subject to capacity restrictions on the agents. A new algorithm for the generalized assignment problem is presented that employs both column generation and branch-and-bound to obtain optimal integer solutions to a set partitioning formulation of the problem.

Keywords: integer programming; optimization algorithm for the GAP (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (90)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.45.6.831 (application/pdf)

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:inm:oropre:v:45:y:1997:i:6:p:831-841

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().