SYMPHONY

swMATH4718MaRDI QIDQ16886FDOQ16886

Author name not available (Why is that?)

Official website: https://projects.coin-or.org/SYMPHONY/

Cited In (80)

• Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
• The variable sequencing approach: A solution to the capital budget allocation model
• An experimental study of bicriteria models for robust timetabling
• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
• On the Satisfiability of Modular Arithmetic Formulae
• An improved algorithm for solving biobjective integer programs
• 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
• MDPLIB
• Integer programming techniques for the nurse rostering problem
• Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
• Performance analysis of branch-and-bound skeletons
• 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
• Title not available (Why is that?)
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
• EAGO.jl: easy advanced global optimization in Julia
• Restrict-and-relax search for 0-1 mixed-integer programs
• Noncommercial software for mixed-integer linear programming
• MALLBA
• FiberSCIP—A Shared Memory Parallelization of SCIP
• 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
• PolySCIP
• ParSSSE
• ParaLEX
• Bob++
• PPBB
• MibS
• CapoOne
• ValidatedNumerics.jl
• Polaris
• A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
• A library of local search heuristics for the vehicle routing problem
• Airline crew scheduling: state-of-the-art
• Title not available (Why is that?)
• PEBBL: an object-oriented framework for scalable parallel branch and bound
• Parallel branch, cut, and price for large-scale discrete optimization
• 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
• A library hierarchy for implementing scalable parallel search algorithms
• Modeling and solving profitable location and distribution problems
• Modeling and solving the capacitated vehicle routing problem on trees
• Computational Integer Programming and Cutting Planes
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• A global optimization and adaptivity-based algorithm for automated edge grid generation
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
• Shift-and-propagate
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation

This page was built for software: SYMPHONY