Lagrangean Decomposition In Integer Linear Programming: A New Scheme

DOI10.1080/03155986.1992.11732179MaRDI QIDQ4009106zbMATH OpenOpenAlexFDO

Authors Hernaldo Reinoso, Nelson 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 decompositionLagrangean relaxation

Mathematics Subject Classification ID

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

Recommendations

• Lagrangean decomposition for integer programming : theory and applications
• Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• scientific article; zbMATH DE number 3976783
• scientific article; zbMATH DE number 4053350

Cited in

(19)

• Lagrangean decomposition for integer nonlinear programming with linear constraints
• Polyhedral analysis and decompositions for capacitated plant location-type problems
• Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
• Lagrangean relaxation. (With comments and rejoinder).
• A Lagrangian decomposition scheme for choice-based optimization
• scientific article; zbMATH DE number 3856814 (Why is no real title available?)
• scientific article; zbMATH DE number 3898614 (Why is no real title available?)
• scientific article; zbMATH DE number 3976783 (Why is no real title available?)
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean decomposition for integer programming : theory and applications
• scientific article; zbMATH DE number 4053350 (Why is no real title available?)
• scientific article; zbMATH DE number 1450264 (Why is no real title available?)
• An homage to Joseph-Louis Lagrange and Pierre Huard
• pth power Lagrangian method for integer programming
• Hub-and-spoke network design and fleet deployment for string planning of liner shipping
• Mixed decomposition in block integer linear programming problems
• An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
• An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane
• A Lagrangian bound for many-to-many assignment problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009106)