DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES
From MaRDI portal
Publication:5249013
DOI10.1142/S0129054199000289zbMath1319.68246OpenAlexW1580324059MaRDI QIDQ5249013
Geppino Pucci, Kieran T. Herley, Andrea Pietracaprina
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054199000289
Approximation methods and heuristics in mathematical programming (90C59) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)
Related Items (1)
Cites Work
- Parallel priority queues
- Randomized parallel algorithms for backtrack search and branch-and-bound computation
- How to share memory in a distributed system
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Branch-and-bound and backtrack search on mesh-connected arrays of processors
- Representing shared data on distributed-memory parallel computers
This page was built for publication: DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES