Cited in
(82)- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- On the facet defining inequalities of the mixed-integer bilinear covering set
- Deterministic global optimization of steam cycles using the IAPWS-IF97 model
- MIPLIB 2003
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- On the strength of Gomory mixed-integer cuts as group cuts
- ICOS: a branch and bound based solver for rigorous global optimization
- Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23--27, 2011. Proceedings
- Reachability analysis of linear dynamic systems with constant, arbitrary, and Lipschitz continuous inputs
- Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm
- Communication protocols for options and results in a distributed optimization environment
- Sequential bounding methods for two-stage stochastic programs
- Deterministic global optimization with Gaussian processes embedded
- The positive edge criterion within COIN-OR's CLP
- ASYNPLEX
- lpSolve
- KORBX
- Cbc
- COIN-OR
- ConicBundle
- PyCOIN
- LPFML
- Valse-XT
- MIPLIB2003
- Ev3
- DEVEX
- STOP
- Cgllandp
- DIP
- MPL
- Cgl
- CRNreals
- CUTGEN1
- DyLP
- XMLSpy
- CMPL
- pyCMPL
- MathProgBase
- On the safety of Gomory cut generators
- PyCPX
- PyLPSolve
- MibS
- CyLP
- Monopoly
- MAiNGO
- casiopeia
- FPBH.jl
- ParISS
- cspy
- PyEMD
- VRPy
- GALINI
- Complexity analysis and algorithm design of pooling problem
- HiGHS
- Valid inequalities based on the interpolation procedure
- The `Idiot' crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems
- SCIP: solving constraint integer programs
- Decomposition, reformulation, and diving in university course timetabling
- RAPOSa
- Deterministic global optimization in ab-initio quantum chemistry
- Minotaur: a mixed-integer nonlinear optimization toolkit
- LDLFactorizations.jl
- LPBenchmarks
- Tulip.jl
- UnitBlockAngular.jl
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- On parallelizing dual decomposition in stochastic integer programming
- Permutations in the Factorization of Simplex Bases
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- CasADi: a software framework for nonlinear optimization and optimal control
- Customizing the solution process of COIN-OR's linear solvers with python
- Parallelizing the dual revised simplex method
- On optimizing over lift-and-project closures
- Design and implementation of a modular interior-point solver for linear optimization
- Integer programming approach to static monopolies in graphs
- libALE
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
- On smooth reformulations and direct non-smooth computations for minimax problems
- Bound reduction using pairs of linear inequalities
- Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
This page was built for software: CLP
