The generalized assignment problem and extensions

DOI10.1007/0-387-23830-1_6MaRDI QIDQ5692516zbMATH OpenOpenAlexFDO

Authors Dolores Romero Morales, H. Edwin Romeijn

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)

Cited in

(6)

• Optimized assignment patterns in mobile edge cloud networks
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Fleet management: a vehicle and driver assignment model
• 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

This page was built for publication: The generalized assignment problem and extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5692516)