Cited in
(85)- 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
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- An improved algorithm for solving biobjective integer programs
- On the Satisfiability of Modular Arithmetic Formulae
- OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- Computational experience with a software framework for parallel integer programming
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
- Integer programming techniques for the nurse rostering problem
- Performance analysis of branch-and-bound skeletons
- Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
- Branching in branch-and-price: A generic scheme
- Communication protocols for options and results in a distributed optimization environment
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- ALPS
- MALLBA
- PICO
- ABACUS
- UG
- Zimpl
- COIN-OR
- MINTO
- Concorde
- BonsaiG
- TSP software
- BiCePS
- BLIS
- FiberSCIP
- LPFML
- CHiPPS
- OREX-J
- PLplot
- SLPTESTSET
- Hibernate
- MCDMlib
- Satin
- BEAGLE
- BaPCod
- GENCOL
- MPL
- Cgl
- COIN/BCP
- OsiSolver
- PEBBL
- DCCP
- PolySCIP
- DyLP
- XMLSpy
- CMPL
- pyCMPL
- ParSSSE
- ParaLEX
- Restrict-and-relax search for 0-1 mixed-integer programs
- Bob++
- PPBB
- MibS
- CapoOne
- ValidatedNumerics.jl
- Polaris
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- EAGO.jl: easy advanced global optimization in Julia
- Noncommercial software for mixed-integer linear programming
- FiberSCIP—A Shared Memory Parallelization of SCIP
- PolySCIP
- A library of local search heuristics for the vehicle routing problem
- A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
- Airline crew scheduling: state-of-the-art
- PEBBL: an object-oriented framework for scalable parallel branch and bound
- scientific article; zbMATH DE number 2084782 (Why is no real title available?)
- Parallel branch, cut, and price for large-scale discrete optimization
- The variable sequencing approach: A solution to the capital budget allocation model
- On parallel branch and bound frameworks for global optimization
- The next wave in computing, optimization, and decision technologies. Papers from the ninth INFORMS Computing Society conference (ICS 2005), Annapolis, MD, USA, January 5--7, 2005.
- Formulations and exact algorithms for the vehicle routing problem with time windows
- Modeling and solving profitable location and distribution problems
- A library hierarchy for implementing scalable parallel search algorithms
- An experimental study of bicriteria models for robust timetabling
- MDPLIB
- Modeling and solving the capacitated vehicle routing problem on trees
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Computational Integer Programming and Cutting Planes
- A global optimization and adaptivity-based algorithm for automated edge grid generation
- Shift-and-propagate
This page was built for software: SYMPHONY
