Cited in
(38)- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- Computational experience with a software framework for parallel integer programming
- Parallelization of the FICO Xpress-Optimizer
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
- Could we use a million cores to solve an integer program?
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- SelfSplit parallelization for mixed-integer linear programming
- ALPS
- FATCOP
- PICO
- ABACUS
- UG
- BonsaiG
- SYMPHONY
- DSP
- METSlib
- BiCePS
- BLIS
- FiberSCIP
- ParaSCIP
- SIPLIB
- Cgl
- COIN/BCP
- PEBBL
- ParaXpress
- ParaLEX
- pPCx
- Bob++
- MibS
- Kendo
- GPUBasedACS
- Benders decomposition: solving binary master problems by enumeration
- FiberSCIP—A Shared Memory Parallelization of SCIP
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- PEBBL: an object-oriented framework for scalable parallel branch and bound
- Parallel and distributed local search in COMET
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
This page was built for software: CHiPPS
