Vector Space Decomposition for Solving Large-Scale Linear Programs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4108484
- Relaxation Method for Large Scale Linear Programming Using Decomposition
- scientific article; zbMATH DE number 1131735
- An efficient decomposition method for linear programming problems
- Solving Large Batches of Linear Programs
- Interior-point methods with decomposition for solving large-scale linear programs
- Decomposition of linear programs using parallel computation
- A convex optimization approach for solving large scale linear systems
- Space-decomposition minimization method for large-scale minimization problems
- Row-Oriented Decomposition in Large-Scale Linear Optimization
Cites work
- A strongly polynomial contraction-expansion algorithm for network flow problems
- About the minimum mean cycle-canceling algorithm
- An improved primal simplex algorithm for degenerate linear programs
- Bi-dynamic constraint aggregation and subproblem reduction
- Decomposition Principle for Linear Programs
- Decomposition theorems for linear programs
- Dual inequalities for stabilized column generation revisited
- Dual-Optimal Inequalities for Stabilized Column Generation
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling
- Finding minimum-cost circulations by canceling negative cycles
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 47262 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- Influence of the normalization constraint on the integral simplex using decomposition
- Integral simplex using decomposition for the set partitioning problem
- Linear Programming
- Linear Programming
- Minimum-cost flow algorithms: an experimental evaluation
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Network flows. Theory, algorithms, and applications.
- On the choice of explicit stabilizing terms in column generation
- Pivot selection methods of the Devex LP code
- Selected Topics in Column Generation
- Solving Real-World Linear Programs: A Decade and More of Progress
- Stabilized column generation
- Steepest-edge simplex algorithms for linear programming
- The positive edge criterion within COIN-OR's CLP
- Using extra dual cuts to accelerate column generation
Cited in
(9)- Decomposition theorems for linear programs
- A polyhedral model for enumeration and optimization over the set of circuits
- The minimum mean cycle-canceling algorithm for linear programs
- An implementation of steepest-descent augmentation for linear programs
- ANALYSIS OF THE STRONG INSTANCE FOR THE VECTOR DECOMPOSITION PROBLEM
- Global pricing and feasible directions in linear programming
- On the hardness of short and sign-compatible circuit walks
- On the circuit diameter conjecture for counterexamples to the Hirsch conjecture
- Data mapping of linear programming on fixed-size hypercubes
This page was built for publication: Vector Space Decomposition for Solving Large-Scale Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4971568)
