Comparison of parallel implementations of the branch-and-bound method for shared memory systems
From MaRDI portal
Publication:6178124
DOI10.1134/s1064230723020090OpenAlexW4387209686MaRDI QIDQ6178124
A. Yu. Gorchakov, Mikhail A. Posypkin
Publication date: 18 January 2024
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064230723020090
Optimal stochastic control (93E20) Parallel algorithms in computer science (68W10) Computer system organization (68Mxx)
Cites Work
- Unnamed Item
- An application of the nonuniform covering method to global optimization of mixed integer nonlinear problems
- An Automatic Method of Solving Discrete Programming Problems
- Handbook of Heuristics
- Branch-and-Bound interval global optimization on shared memory multiprocessors
- Minimization by Random Search Techniques
- A Modern Introduction to Probability and Statistics
- Branch-and-Bound Methods: A Survey
This page was built for publication: Comparison of parallel implementations of the branch-and-bound method for shared memory systems
