A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem

June S. Park, Byung Ha Lim, Youngho Lee

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

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 algorithm, when incorporated into a branch-and-bound algorithm as the lower bounding scheme, can accelerate the search process. Computational results demonstrate the efficiency and robustness of this branch-and-bound algorithm not only for GMAPs, but for GAPs that are more difficult than could be solved by previous algorithms.

Original languageEnglish
JournalManagement Science
Volume44
Issue number12 PART 2
Publication statusPublished - 1998 Dec 1

Fingerprint

Branch and bound algorithm
Assignment problem
Robustness

Keywords

  • Generalized Assignment Problem
  • Generalized Multi-Assignment Problem
  • Lagrangian Dual Ascent
  • Lagrangian Dual-Based Branch and Bound
  • Subgradient Search

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research

Cite this

A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem. / Park, June S.; Lim, Byung Ha; Lee, Youngho.

In: Management Science, Vol. 44, No. 12 PART 2, 01.12.1998.

Research output: Contribution to journalArticle

@article{cce89c4d9b8c4832816cd3e0a753f959,
title = "A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem",
abstract = "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 algorithm, when incorporated into a branch-and-bound algorithm as the lower bounding scheme, can accelerate the search process. Computational results demonstrate the efficiency and robustness of this branch-and-bound algorithm not only for GMAPs, but for GAPs that are more difficult than could be solved by previous algorithms.",
keywords = "Generalized Assignment Problem, Generalized Multi-Assignment Problem, Lagrangian Dual Ascent, Lagrangian Dual-Based Branch and Bound, Subgradient Search",
author = "Park, {June S.} and Lim, {Byung Ha} and Youngho Lee",
year = "1998",
month = "12",
day = "1",
language = "English",
volume = "44",
journal = "Management Science",
issn = "0025-1909",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "12 PART 2",

}

TY - JOUR

T1 - A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem

AU - Park, June S.

AU - Lim, Byung Ha

AU - Lee, Youngho

PY - 1998/12/1

Y1 - 1998/12/1

N2 - 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 algorithm, when incorporated into a branch-and-bound algorithm as the lower bounding scheme, can accelerate the search process. Computational results demonstrate the efficiency and robustness of this branch-and-bound algorithm not only for GMAPs, but for GAPs that are more difficult than could be solved by previous algorithms.

AB - 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 algorithm, when incorporated into a branch-and-bound algorithm as the lower bounding scheme, can accelerate the search process. Computational results demonstrate the efficiency and robustness of this branch-and-bound algorithm not only for GMAPs, but for GAPs that are more difficult than could be solved by previous algorithms.

KW - Generalized Assignment Problem

KW - Generalized Multi-Assignment Problem

KW - Lagrangian Dual Ascent

KW - Lagrangian Dual-Based Branch and Bound

KW - Subgradient Search

UR - http://www.scopus.com/inward/record.url?scp=0032292447&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032292447&partnerID=8YFLogxK

M3 - Article

VL - 44

JO - Management Science

JF - Management Science

SN - 0025-1909

IS - 12 PART 2

ER -