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