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.90536MaRDI QIDQ2784114
Byung Ha Lim, Youngho Lee, June S. Park
Publication date: 17 April 2002
Published in: Management Science (Search for Journal in Brave)
generalized assignment problem; subgradient search; generalized multi-assignment problem; Lagrangian dual ascent; Lagrangian dual-based branch-and-bound
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B80: Discrete location and assignment
Related Items
The equilibrium generalized assignment problem and genetic algorithm, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, Generalized cover facet inequalities for the generalized assignment problem
Uses Software