Decomposition theorems for linear programs

DOI10.1016/j.orl.2014.10.001zbMath1408.90173OpenAlexW1969119890MaRDI QIDQ1785306

Jacques Desrosiers, Jean Bertrand Gauthier, Marco E. Lübbecke

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2014.10.001

zbMATH Keywords

linear programmingoptimality conditionsnetwork problemsflow decompositionresidual problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items

Equivalent formulations for the branched transport and urban planning problems, Circuit walks in integral polyhedra, Vector Space Decomposition for Solving Large-Scale Linear Programs, A polyhedral model for enumeration and optimization over the set of circuits, The minimum mean cycle-canceling algorithm for linear programs, Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• About the minimum mean cycle-canceling algorithm
• Tight bounds on the number of minimum-mean cycle cancellations and related results
• Decomposition Principle for Linear Programs
• Finding minimum-cost circulations by canceling negative cycles
• Selected Topics in Column Generation