Vector Space Decomposition for Solving Large-Scale Linear Programs
From MaRDI portal
Publication:4971568
DOI10.1287/opre.2018.1728zbMath1455.90105OpenAlexW2886913458MaRDI QIDQ4971568
Marco E. Lübbecke, Jacques Desrosiers, Jean Bertrand Gauthier
Publication date: 12 October 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5a982bd1f28dd2a8b779e214192b3ccd8b559eb9
column generationcyclesdegeneracyvector spaceprimal simplex algorithmresidual problemoptimized reduced costspositive step size algorithms
Related Items
An implementation of steepest-descent augmentation for linear programs, A polyhedral model for enumeration and optimization over the set of circuits, The minimum mean cycle-canceling algorithm for linear programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The positive edge criterion within COIN-OR's CLP
- About the minimum mean cycle-canceling algorithm
- Influence of the normalization constraint on the integral simplex using decomposition
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- On the choice of explicit stabilizing terms in column generation
- Stabilized column generation
- A strongly polynomial contraction-expansion algorithm for network flow problems
- Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling
- Decomposition theorems for linear programs
- Steepest-edge simplex algorithms for linear programming
- Bi-dynamic constraint aggregation and subproblem reduction
- Dual Inequalities for Stabilized Column Generation Revisited
- Integral Simplex Using Decomposition for the Set Partitioning Problem
- Using Extra Dual Cuts to Accelerate Column Generation
- An Improved Primal Simplex Algorithm for Degenerate Linear Programs
- Minimum-cost flow algorithms: an experimental evaluation
- Decomposition Principle for Linear Programs
- Dual-Optimal Inequalities for Stabilized Column Generation
- Finding minimum-cost circulations by canceling negative cycles
- Solving Real-World Linear Programs: A Decade and More of Progress
- Linear Programming
- Linear Programming
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Selected Topics in Column Generation
- Pivot selection methods of the Devex LP code
