The Generalized Assignment Problem and Extensions

DOI10.1007/0-387-23830-1_6zbMath1274.90202OpenAlexW1810836712MaRDI QIDQ5692516

H. Edwin Romeijn, Dolores Romero Morales

Publication date: 28 September 2005

Published in: Handbook of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/0-387-23830-1_6

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (6)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Lower and upper bounds for the non-linear generalized assignment problem ⋮ A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem ⋮ A three-phase matheuristic algorithm for the multi-day task assignment problem ⋮ Fleet management: a vehicle and driver assignment model ⋮ Optimized assignment patterns in mobile edge cloud networks

This page was built for publication: The Generalized Assignment Problem and Extensions