CLP

swMATH5089MaRDI QIDQ17229

No author found.

Source code repository: https://github.com/coin-or/Clp

Related Items (38)

Minotaur: a mixed-integer nonlinear optimization toolkit ⋮ Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs ⋮ Reachability analysis of linear dynamic systems with constant, arbitrary, and Lipschitz continuous inputs ⋮ Communication protocols for options and results in a distributed optimization environment ⋮ Parallelizing the dual revised simplex method ⋮ Sequential Bounding Methods for Two-Stage Stochastic Programs ⋮ The positive edge criterion within COIN-OR's CLP ⋮ Bound reduction using pairs of linear inequalities ⋮ On optimizing over lift-and-project closures ⋮ Deterministic global optimization in ab-initio quantum chemistry ⋮ Complexity analysis and algorithm design of pooling problem ⋮ Practical strategies for generating rank-1 split cuts in mixed-integer linear programming ⋮ On smooth reformulations and direct non-smooth computations for minimax problems ⋮ Customizing the solution process of COIN-OR's linear solvers with python ⋮ The ‘Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems ⋮ Computational advances in polynomial optimization: RAPOSa, a freely available global solver ⋮ On the facet defining inequalities of the mixed-integer bilinear covering set ⋮ Deterministic global optimization of steam cycles using the IAPWS-IF97 model ⋮ A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation ⋮ On parallelizing dual decomposition in stochastic integer programming ⋮ Permutations in the Factorization of Simplex Bases ⋮ CasADi: a software framework for nonlinear optimization and optimal control ⋮ MIPLIB 2003 ⋮ On the strength of Gomory mixed-integer cuts as group cuts ⋮ Integer programming approach to static monopolies in graphs ⋮ 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 ⋮ Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization ⋮ Valid inequalities based on the interpolation procedure ⋮ Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks ⋮ Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm ⋮ SCIP: solving constraint integer programs ⋮ On the safety of Gomory cut generators ⋮ Design and implementation of a modular interior-point solver for linear optimization ⋮ Deterministic global optimization with Gaussian processes embedded ⋮ ICOS: a branch and bound based solver for rigorous global optimization ⋮ Decomposition, reformulation, and diving in university course timetabling ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut

This page was built for software: CLP