The positive edge pricing rule for the dual simplex
From MaRDI portal
Publication:337606
DOI10.1016/J.COR.2015.03.009zbMATH Open1348.90461OpenAlexW1975381074MaRDI QIDQ337606FDOQ337606
Mehdi Towhidi, Jérémy Omer, François Soumis
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.03.009
Recommendations
Cites Work
- Benchmarking optimization software with performance profiles.
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Solving Real-World Linear Programs: A Decade and More of Progress
- A practical anti-cycling procedure for linearly constrained optimization
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Improved primal simplex: a more general theoretical framework and an extended experimental analysis
- An improved primal simplex algorithm for degenerate linear programs
- A linear programming decomposition focusing on the span of the nondegenerate columns
- The positive edge criterion within COIN-OR's CLP
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- A Revised Dual Projective Pivot Algorithm for Linear Programming
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- A dual approach to primal degeneracy
- Steepest-edge simplex algorithms for linear programming
- A generalized dual phase-2 simplex algorithm.
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Title not available (Why is that?)
Uses Software
This page was built for publication: The positive edge pricing rule for the dual simplex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337606)