Lagrangian Decomposition Based Heuristic For The Generalized Assignment Problem

DOI10.1080/03155986.1999.11732392OpenAlexW2406640649MaRDI QIDQ5888113

Salim Haddadi

Publication date: 21 April 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1999.11732392

zbMATH Keywords

Lagrangian decompositionLagrangian heuristicgeneralized assignment

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (4)

Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ Effective algorithm and heuristic for the generalized assignment problem. ⋮ Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem

This page was built for publication: Lagrangian Decomposition Based Heuristic For The Generalized Assignment Problem