The positive edge criterion within COIN-OR's CLP

DOI10.1016/J.COR.2014.03.020MaRDI QIDQ342010zbMATH OpenOpenAlexFDO

Authors Mehdi Towhidi, Jacques Desrosiers, François Soumis

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

zbMATH Keywords

linear programmingdegeneracypositive edgeprimal simplex

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

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

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3614492 (Why is no real title available?)
• scientific article; zbMATH DE number 3354790 (Why is no real title available?)
• A basis-defiency-allowing variation of the simplex method for linear programming
• A new version of the improved primal simplex for degenerate linear programs
• A practicable steepest-edge simplex algorithm
• Aggregation and Disaggregation Techniques and Methodology in Optimization
• An improved primal simplex algorithm for degenerate linear programs
• New Finite Pivoting Rules for the Simplex Method
• On the choice of explicit stabilizing terms in column generation
• On the solution of highly degenerate linear programmes
• Optimality and Degeneracy in Linear Programming
• Solving large-scale linear programs by aggregation
• Stabilized column generation
• Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
• Steepest-edge simplex algorithms for linear programming

Cited in

(6)

• 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
• The positive edge pricing rule for the dual simplex
• Integral simplex using decomposition with primal cutting planes
• Customizing the solution process of COIN-OR's linear solvers with python

Describes a project that uses

Uses Software

• DEVEX
• CLP
• COIN-OR
• KORBX
• CPLEX

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)