A Branch-and-Price Algorithm for the Generalized Assignment Problem
- 1 December 1997
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 45 (6) , 831-841
- https://doi.org/10.1287/opre.45.6.831
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
This publication has 0 references indexed in Scilit: