A branch-and-price algorithm for the generalized assignment problem
成果类型：
Article
署名作者：
Savelsbergh, M
署名单位：
University System of Georgia; Georgia Institute of Technology
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.45.6.831
发表日期：
1997
页码：
831-841
关键词：
摘要：
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.