Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
From MaRDI portal
Publication:2458085
Recommendations
- scientific article; zbMATH DE number 1206103
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- Efficiency considerations in the implementation of parallel branch-and- bound
- On parallel branch and bound frameworks for global optimization
- Performance of parallel branch-and-bound algorithms
- Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
- scientific article; zbMATH DE number 1489804
- scientific article; zbMATH DE number 934536
- Towards a heterogeneous and adaptive parallel branch-and-bound algorithm
Cites work
Cited in
(6)- On one approach to realization of the branch-and-bound method on a distributed system
- Speedup estimates for some variants of the parallel implementations of the branch-and-bound method
- Investigation of algorithms of parallel computations in knapsack-type discrete optimization problems
- scientific article; zbMATH DE number 5503918 (Why is no real title available?)
- Optimization parallelizing for discrete programming problems
- Parallel branch, cut, and price for large-scale discrete optimization
This page was built for publication: Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458085)
