Lagrangean Decomposition In Integer Linear Programming: A New Scheme

DOI10.1080/03155986.1992.11732179zbMath0760.90073OpenAlexW2400968767MaRDI QIDQ4009106

Hernaldo Reinoso, Nelson F. Maculan

Publication date: 27 September 1992

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

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

zbMATH Keywords

Lagrangean relaxationLagrangean decomposition

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items (7)

Lagrangean relaxation. (With comments and rejoinder). ⋮ An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane ⋮ Polyhedral analysis and decompositions for capacitated plant location-type problems ⋮ An homage to Joseph-Louis Lagrange and Pierre Huard ⋮ A Lagrangian bound for many-to-many assignment problems ⋮ Hub-and-spoke network design and fleet deployment for string planning of liner shipping ⋮ An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

This page was built for publication: Lagrangean Decomposition In Integer Linear Programming: A New Scheme