A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem

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

zbMATH Keywords

generalized assignment problemsubgradient searchgeneralized multi-assignment problemLagrangian dual ascentLagrangian dual-based branch-and-bound

Mathematics Subject Classification ID

Related Items (5)

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

• CPLEX

This page was built for publication: A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem