The positive edge criterion within COIN-OR's CLP
From MaRDI portal
Publication:342010
DOI10.1016/J.COR.2014.03.020zbMATH Open1349.90612OpenAlexW2022113358MaRDI QIDQ342010FDOQ342010
Jacques Desrosiers, François Soumis, Mehdi Towhidi
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.03.020
Recommendations
- Copositivity cuts for improving SDP bounds on the clique number
- Positive zero forcing and edge clique coverings
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- Testing copositivity via mixed-integer linear programming
- Copositive programming by simplicial partition
- Contribution of copositive formulations to the graph partitioning problem
- A branch-and-cut algorithm for the edge interdiction clique problem
- An LP-based algorithm to test copositivity
- Contribution of copositive formulations to graph partitioning problem
- Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle
Cites Work
- Title not available (Why is that?)
- Stabilized column generation
- Solving large-scale linear programs by aggregation
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- New Finite Pivoting Rules for the Simplex Method
- A basis-defiency-allowing variation of the simplex method for linear programming
- An improved primal simplex algorithm for degenerate linear programs
- A practicable steepest-edge simplex algorithm
- Optimality and Degeneracy in Linear Programming
- A new version of the improved primal simplex for degenerate linear programs
- On the choice of explicit stabilizing terms in column generation
- Steepest-edge simplex algorithms for linear programming
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
- On the solution of highly degenerate linear programmes
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- Improved primal simplex: a more general theoretical framework and an extended experimental analysis
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- A linear programming decomposition focusing on the span of the nondegenerate columns
- Integral simplex using decomposition with primal cutting planes
- The positive edge pricing rule for the dual simplex
Uses Software
This page was built for publication: The positive edge criterion within COIN-OR's CLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342010)
