The generalized assignment problem examines the maximum pro t assignment o f 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.
A branch-and-price algorithm was designed in REF that employs both column generation and branch-andbound to obtain optimal integer solutions.
A Branch-and-Price Algorithm for the Generalized Assignment Problem
Oper. Res.
Oper. Res.
Computer Science Mathematics