Anomalies in parallel branch-and-bound algorithms
From MaRDI portal
Publication:3713596
DOI10.1145/358080.358103zbMath0587.68032OpenAlexW2005933636MaRDI QIDQ3713596
Sartaj K. Sahni, Ten-Hwang Lai
Publication date: 1984
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/358080.358103
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)
Related Items (37)
An introduction to parallelism in combinatorial optimization ⋮ Nagging: A scalable fault-tolerant paradigm for distributed search ⋮ A parallel branch and bound algorithm for the quadratic assignment problem ⋮ A parallel integer linear programming algorithm ⋮ Branch-and-bound and parallel computation: A historical note ⋮ A parallel interval method implementation for global optimization using dynamic load balancing ⋮ The general problem solving algorithm and its implementation ⋮ Parallel algorithms for a multi-level network optimization problem ⋮ A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions ⋮ AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗ ⋮ A review of literature on parallel constraint solving ⋮ A simulation tool for the performance evaluation of parallel branch and bound algorithms ⋮ Parallel depth first search. I: Implementation ⋮ Parallel depth first search. II: Analysis ⋮ Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem ⋮ Performances of parallel branch and bound algorithms with best-first search ⋮ Parallel radial basis function methods for the global optimization of expensive functions ⋮ On parallel branch and bound frameworks for global optimization ⋮ Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization ⋮ Speedup estimates for some variants of the parallel implementations of the branch-and-bound method ⋮ Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem ⋮ Branch-and-bound as a higher-order function ⋮ Multi-threading a state-of-the-art maximum clique algorithm ⋮ Data-movement-intensive problems: Two folk theorems in parallel computation revisited ⋮ A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems ⋮ Parallel best-first branch-and-bound in discrete optimization: a framework ⋮ Building a parallel branch and bound library ⋮ Large-scale 0-1 linear programming on distributed workstations ⋮ A multiple-tree search procedure for the resource-constrained project scheduling problem ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ Parallel state-space search for a first solution with consistent linear speedups ⋮ A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning ⋮ Efficiency considerations in the implementation of parallel branch-and- bound ⋮ Parallel evolutionary algorithms can achieve super-linear performance ⋮ PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE ⋮ An upper bound for the speedup of parallel best-bound branch-and-bound algorithms ⋮ A parallel branch and bound algorithm for the maximum labelled clique problem
This page was built for publication: Anomalies in parallel branch-and-bound algorithms
