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

@inproceedings{Park1998ALD,
  title={A Lagrangian Dual-Based Branch-And-Bound Algorithm for the Generalized Multi-Assignment Problem},
  author={June Sung Park and Byung Ha Lim and Youngho Lee},
  year={1998}
}
This paper develops a Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem (GMAP) which includes the well-known generalized assignment problem (GAP) as a special case. In GMAP, an object may be required to be duplicated in multiple locations. We develop a Lagrangian dual ascent algorithm for GMAP. This dual ascent and the subgradient search each possess advantages that can be combined to develop a new Lagrangian dual search algorithm. The latter… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 10 CITATIONS

Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach

  • INFORMS Journal on Computing
  • 2003
VIEW 4 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS
HIGHLY INFLUENCED

The 0 -1 multiple knapsack problem

VIEW 2 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Allocation algorithms for personal TV advertisements

  • Multimedia Systems
  • 2012
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A Survey of the Generalized Assignment Problem and Its Applications

  • INFOR
  • 2007
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The equilibrium generalized assignment problem and genetic algorithm

  • Applied Mathematics and Computation
  • 2012
VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS