Lagrangian relaxation for integer programming

DOI10.1007/978-3-540-68279-0_9MaRDI QIDQ3565238zbMATH OpenOpenAlexFDO

Authors A. M. Geoffrion

Publication date 3 June 2010

Published in 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68279-0_9

Mathematics Subject Classification ID

Collected or selected works; reprintings or translations of classics (01A75) History of operations research and mathematical programming (90-03) Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 1094769
• Lagrangean relaxation. (With comments and rejoinder).
• Lagrangean ralaxation revisited. (Technical note)
• The omnipresence of Lagrange
• scientific article; zbMATH DE number 2084780

Cited in

(19)

• Solution of a tinned iron purchasing problem by Lagrangean relaxation
• Service system design for managing interruption risks: a backup-service risk-mitigation strategy
• An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
• Decomposition of loosely coupled integer programs: a multiobjective perspective
• Lagrangian relaxation of the generic materials and operations planning model
• Generalized nonlinear Lagrangian formulation for bounded integer programming
• A Lagrangian decomposition approach for the pump scheduling problem in water networks
• The Lagrangian relaxation for the combinatorial integral approximation problem
• Incorporating location, inventory and price decisions into a supply chain distribution network design problem
• scientific article; zbMATH DE number 5506108 (Why is no real title available?)
• scientific article; zbMATH DE number 3900505 (Why is no real title available?)
• scientific article; zbMATH DE number 4074812 (Why is no real title available?)
• scientific article; zbMATH DE number 3628723 (Why is no real title available?)
• scientific article; zbMATH DE number 5173819 (Why is no real title available?)
• pth power Lagrangian method for integer programming
• Modeling and solving an economies‐of‐scale service system design problem
• Generator subadditive functions for mixed-integer programs
• Integrated E-waste supply chain optimization via Lagrangian relaxation: shared-fleet collection, robotic disassembly and redistribution
• About Lagrangian methods in integer optimization

This page was built for publication: Lagrangian relaxation for integer programming

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