Decomposition theorems for linear programs
From MaRDI portal
Recommendations
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- The decomposition principle and algorithms for linear programs under interior point method. I, II
- The minimum mean cycle-canceling algorithm for linear programs
- An efficient decomposition method for linear programming problems
- scientific article; zbMATH DE number 3892925
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- About the minimum mean cycle-canceling algorithm
- Decomposition Principle for Linear Programs
- Finding minimum-cost circulations by canceling negative cycles
- Network flows. Theory, algorithms, and applications.
- Selected Topics in Column Generation
- Tight bounds on the number of minimum-mean cycle cancellations and related results
Cited in
(7)- Kato decomposition theorem for linear pencils
- Equivalent formulations for the branched transport and urban planning problems
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- The minimum mean cycle-canceling algorithm for linear programs
- Pivot rules for circuit-augmentation algorithms in linear optimization
- A polyhedral model for enumeration and optimization over the set of circuits
- Circuit walks in integral polyhedra
This page was built for publication: Decomposition theorems for linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785306)