Customizing the solution process of COIN-OR's linear solvers with python

DOI10.1007/s12532-015-0094-2zbMath1392.90078OpenAlexW2258894760WikidataQ121699152 ScholiaQ121699152MaRDI QIDQ1694292

Dominique Orban, Mehdi Towhidi

Publication date: 1 February 2018

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-015-0094-2

zbMATH Keywords

linear programmingmixed integer programmingCBCpythonCLPCGLCOIN-ORcythonsimplex pivot

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05)

Related Items (3)

Customizing the solution process of COIN-OR's linear solvers with python ⋮ Maximizing recyclable materials and user utility in waste collection: a linear-quadratic bilevel optimization approach ⋮ CyLP

Uses Software

• SoPlex
• CPLEX
• Gurobi
• lpSolve
• KORBX
• Netlib
• Cbc
• GLPK
• COIN-OR
• Ipopt
• PuLP
• CLP
• PyCOIN
• SciPy
• NumPy
• DEVEX
• Cgl
• Cython
• Python
• cyipopt
• PyCPX
• PyLPSolve

Cites Work

• Unnamed Item
• Unnamed Item
• A new version of the improved primal simplex for degenerate linear programs
• Pivot rules for linear programming: A survey on recent theoretical developments
• Customizing the solution process of COIN-OR's linear solvers with python
• Steepest-edge simplex algorithms for linear programming
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• An analysis of degeneracy
• A practicable steepest-edge simplex algorithm
• New Finite Pivoting Rules for the Simplex Method
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Benchmarking optimization software with performance profiles.

This page was built for publication: Customizing the solution process of COIN-OR's linear solvers with python