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

Abstract

The generalized assignment problem examines the maximum pro t 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 July Revised November Revised October

DOI: 10.1287/opre.45.6.831
0102030'96'98'00'02'04'06'08'10'12'14'16
Citations per Year

295 Citations

Semantic Scholar estimates that this publication has 295 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Savelsbergh1997ABA, title={A Branch-and-Price Algorithm for the Generalized Assignment Problem}, author={Martin W. P. Savelsbergh}, journal={Operations Research}, year={1997}, volume={45}, pages={831-841} }