Parallel Branch-and-Branch Algorithms: Survey and Synthesis
From MaRDI portal
Publication:4834061
DOI10.1287/OPRE.42.6.1042zbMath0824.90096OpenAlexW2060032012WikidataQ115213133 ScholiaQ115213133MaRDI QIDQ4834061
Bernard Gendron, Teodor Gabriel Crainic
Publication date: 23 May 1995
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.42.6.1042
Integer programming (90C10) Parallel numerical computation (65Y05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (36)
Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers ⋮ An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP ⋮ Parallel algorithms for a multi-level network optimization problem ⋮ SelfSplit parallelization for mixed-integer linear programming ⋮ On estimating workload in interval branch-and-bound global optimization algorithms ⋮ A parallel branch-and-bound algorithm for multicommodity location with balancing requirements ⋮ Performances of parallel branch and bound algorithms with best-first search ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ On parallel branch and bound frameworks for global optimization ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ A branch-and-bound framework for unsupervised common event discovery ⋮ Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method ⋮ Speedup estimates for some variants of the parallel implementations of the branch-and-bound method ⋮ A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems ⋮ A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm ⋮ Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm ⋮ A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs ⋮ New quadratic lower bound for multivariate functions in global optimization ⋮ Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems ⋮ Multi-threading a state-of-the-art maximum clique algorithm ⋮ Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Multi-objective branch and bound ⋮ Parallel branch and bound for multidimensional scaling with city-block distances ⋮ A comparison of problem decomposition techniques for the FAP ⋮ An efficient data structure for branch-and-bound algorithm ⋮ Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties ⋮ P2P B&B and GA for the Flow-Shop Scheduling Problem ⋮ A combined parallel algorithm for solving the knapsack problem ⋮ An Event-Driven Algorithm for Agents on the Web ⋮ An exact combinatorial algorithm for minimum graph bisection ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ Service network design in freight transportation ⋮ A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning ⋮ Large-scale parallelism for constraint-based local search: the costas array case study ⋮ Airline crew scheduling: state-of-the-art
This page was built for publication: Parallel Branch-and-Branch Algorithms: Survey and Synthesis
