Anomalies in parallel branch-and-bound algorithms
From MaRDI portal
Publication:3713596
DOI10.1145/358080.358103zbMATH Open0587.68032OpenAlexW2005933636MaRDI QIDQ3713596FDOQ3713596
Authors: Ten H. Lai, Sartaj Sahni 
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
Recommendations
- Performance of parallel branch-and-bound algorithms
- Simple approaches to parallel branch and bound
- scientific article; zbMATH DE number 1163098
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
- Performances of parallel branch and bound algorithms with best-first search
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)
Cited In (50)
- Building a parallel branch and bound library
- Parallel best-first branch-and-bound in discrete optimization: a framework
- A study of parallel branch-and-bound algorithms with best-bound-first search
- Nagging: A scalable fault-tolerant paradigm for distributed search
- Performances of parallel branch and bound algorithms with best-first search
- A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions
- Parallel algorithms for a multi-level network optimization problem
- Title not available (Why is that?)
- A multiple-tree search procedure for the resource-constrained project scheduling problem
- A randomized parallel branch-and-bound algorithm
- AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗
- Parallel radial basis function methods for the global optimization of expensive functions
- Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization
- Parallel evolutionary algorithms can achieve super-linear performance
- Simple approaches to parallel branch and bound
- Data-movement-intensive problems: Two folk theorems in parallel computation revisited
- Performance of parallel branch-and-bound algorithms
- A parallel branch and bound algorithm for the maximum labelled clique problem
- A review of literature on parallel constraint solving
- A parallel interval method implementation for global optimization using dynamic load balancing
- Large-scale 0-1 linear programming on distributed workstations
- Parallel state-space search for a first solution with consistent linear speedups
- Branch and bound on the network model
- A parallel integer linear programming algorithm
- PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
- Speedup estimates for some variants of the parallel implementations of the branch-and-bound method
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
- An introduction to parallelism in combinatorial optimization
- Branch-and-bound and parallel computation: A historical note
- Branch-and-bound as a higher-order function
- Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
- A simulation tool for the performance evaluation of parallel branch and bound algorithms
- Parallel depth first search. I: Implementation
- Title not available (Why is that?)
- A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
- Multi-threading a state-of-the-art maximum clique algorithm
- A parallel branch and bound algorithm for the quadratic assignment problem
- On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method
- On parallel branch and bound frameworks for global optimization
- Parallel depth first search. II: Analysis
- Branch and bound on the network model
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- Anomalous Acceleration in Parallel Multiple-Cost-Row Linear Programming
- Anomalies in distributed branch-and-cut solving of the CVRP with different search strategies
- Efficiency considerations in the implementation of parallel branch-and- bound
- Title not available (Why is that?)
- The general problem solving algorithm and its implementation
- Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method
- Parallel processing for difficult combinatorial optimization problems
This page was built for publication: Anomalies in parallel branch-and-bound algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3713596)
