CLP

swMATH5089MaRDI QIDQ17229FDOQ17229

Author name not available (Why is that?)

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

Cited In (38)

• 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
• The ‘Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems
• 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
• Deterministic global optimization with Gaussian processes embedded
• The positive edge criterion within COIN-OR's CLP
• On the safety of Gomory cut generators
• Complexity analysis and algorithm design of pooling problem
• Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization
• Valid inequalities based on the interpolation procedure
• Sequential Bounding Methods for Two-Stage Stochastic Programs
• Deterministic global optimization in ab-initio quantum chemistry
• Decomposition, reformulation, and diving in university course timetabling
• SCIP: solving constraint integer programs
• Minotaur: a mixed-integer nonlinear optimization toolkit
• 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
• 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
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation

This page was built for software: CLP