SYMPHONY

swMATH4718MaRDI QIDQ16886

No author found.

Related Items (40)

Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem ⋮ EAGO.jl: easy advanced global optimization in Julia ⋮ Integer programming techniques for the nurse rostering problem ⋮ Communication protocols for options and results in a distributed optimization environment ⋮ Computational Integer Programming and Cutting Planes ⋮ Computational Experience with a Software Framework for Parallel Integer Programming ⋮ An improved algorithm for solving biobjective integer programs ⋮ OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms ⋮ Modeling and solving profitable location and distribution problems ⋮ Unnamed Item ⋮ On parallel branch and bound frameworks for global optimization ⋮ Unnamed Item ⋮ PEBBL: an object-oriented framework for scalable parallel branch and bound ⋮ Unnamed Item ⋮ On the Satisfiability of Modular Arithmetic Formulae ⋮ Unnamed Item ⋮ Parallel branch, cut, and price for large-scale discrete optimization ⋮ FiberSCIP—A Shared Memory Parallelization of SCIP ⋮ Branching in branch-and-price: A generic scheme ⋮ A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation ⋮ PolySCIP ⋮ Formulations and exact algorithms for the vehicle routing problem with time windows ⋮ Modeling and Solving the Capacitated Vehicle Routing Problem on Trees ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Shift-and-propagate ⋮ 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. ⋮ A library hierarchy for implementing scalable parallel search algorithms ⋮ A library of local search heuristics for the vehicle routing problem ⋮ Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands ⋮ Performance analysis of branch-and-bound skeletons ⋮ Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework ⋮ Restrict-and-relax search for 0-1 mixed-integer programs ⋮ Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm ⋮ An approximate dynamic programming approach for the vehicle routing problem with stochastic demands ⋮ A global optimization and adaptivity-based algorithm for automated edge grid generation ⋮ A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning ⋮ Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut ⋮ An experimental study of bicriteria models for robust timetabling ⋮ Linearization and parallelization schemes for convex mixed-integer nonlinear optimization ⋮ Airline crew scheduling: state-of-the-art

This page was built for software: SYMPHONY