A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem
From MaRDI portal
Publication:2784114
DOI10.1287/mnsc.44.12.S271zbMath0989.90536OpenAlexW2120024198MaRDI QIDQ2784114
Byung Ha Lim, Youngho Lee, June S. Park
Publication date: 17 April 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.44.12.s271
generalized assignment problemsubgradient searchgeneralized multi-assignment problemLagrangian dual ascentLagrangian dual-based branch-and-bound
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem ⋮ A three-phase matheuristic algorithm for the multi-day task assignment problem ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ The equilibrium generalized assignment problem and genetic algorithm ⋮ Generalized cover facet inequalities for the generalized assignment problem
Uses Software
This page was built for publication: A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem