COIN-OR
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A feasibility pump for mixed integer nonlinear programs
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- ALPS
- CMIT
- MALLBA
- charge_assign
- HiGHS
- PyPBLib
- Sdpsol
- MSLiP
- ASYNPLEX
- GAHC
- SoPlex
- Zimpl
- MIPLIB
- lpSolve
- Parallelizing the dual revised simplex method
- KORBX
- Couenne
- Cbc
- GLPK
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- On parallel branch and bound frameworks for global optimization
- SYMPHONY
- Concorde
- Compact extended linear programming models
- Customizing the solution process of COIN-OR's linear solvers with python
- FEASPUMP
- XPRESS
- CppAD
- APLEpy
- COOPR
- FlopC++
- OpenOpt
- OptimJ
- PuLP
- PyGlpk
- PySP
- LEMON
- CLP
- PyCOIN
- DET2STO
- DDSIP
- MCFClass
- A hybrid optimization approach for the Steiner k-connected network design problem
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
- A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems
- General cut-generating procedures for the stable set polytope
- The demand weighted vehicle routing problem
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
- A relax-and-cut framework for Gomory mixed-integer cuts
- A library hierarchy for implementing scalable parallel search algorithms
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Valse-XT
- SBB
- StAMPL
- A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems
- Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems
- A global optimization point of view to handle non-standard object packing problems
- OREX-J
- glcCluster
- OQNLP
- MIPLIB2003
- Hibernate
- Zinc
- DEVEX
- Cgllandp
- MOPS
- Dsor
- MCDMlib
- On generalized surrogate duality in mixed-integer nonlinear programming
- OptiLog: a framework for SAT-based systems
- Maximum feasible subsystems of distance geometry constraints
- BEAGLE
- Discrete dynamical system approaches for Boolean polynomial optimization
- Partial hyperplane activation for generalized intersection cuts
- MD-jeep
- Distance geometry and data science
- Outer approximation with conic certificates for mixed-integer convex problems
- DINS
- SAMCEF
- GCG
- bc-prod
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition
- BOSS-Quattro
- Granularity in nonlinear mixed-integer optimization
- OpenSolver
- A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
- BBMCL
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- A library for continuous convex separable quadratic knapsack problems
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- Three ideas for a feasibility pump for nonconvex MINLP
- An improved algorithm for solving biobjective integer programs
- Bound reduction using pairs of linear inequalities
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- PySP: modeling and solving stochastic programs in Python
- OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
This page was built for software: COIN-OR
