Efficiency considerations in the implementation of parallel branch-and- bound
From MaRDI portal
(Redirected from Publication:1309863)
Recommendations
Cites work
- An algorithm for the steiner problem in graphs
- An Algorithm for the Traveling Salesman Problem
- Anomalies in parallel branch-and-bound algorithms
- Branch-and-bound as a higher-order function
- Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
- MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
- Superlinear speedup of an efficient sequential algorithm is not possible
Cited in
(8)- Parallel processing for difficult combinatorial optimization problems
- An application of parallel virtual machine framework to film production problem
- Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
- scientific article; zbMATH DE number 5168311 (Why is no real title available?)
- Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem
- Towards an abstract parallel branch and bound machine
- Parallel branch and bound for multidimensional scaling with city-block distances
- PEBBL: an object-oriented framework for scalable parallel branch and bound
This page was built for publication: Efficiency considerations in the implementation of parallel branch-and- bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309863)