A Branch-and-Price Algorithm for the Generalized Assignment Problem
Operations Research · 1997 · Volume 45 · Issue 6
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
Enable JavaScript for citation tools and additional paper interactions.