Deterministic branch-and-bound on distributed memory machines
From MaRDI portal
Recommendations
Cites work
- Branch-and-bound and backtrack search on mesh-connected arrays of processors
- Efficient dispersal of information for security, load balancing, and fault tolerance
- How to share memory in a distributed system
- Parallel priority queues
- Randomized parallel algorithms for backtrack search and branch-and-bound computation
- Representing shared data on distributed-memory parallel computers
Cited in
(7)- On one approach to realization of the branch-and-bound method on a distributed system
- scientific article; zbMATH DE number 1334602 (Why is no real title available?)
- An efficient data structure for branch-and-bound algorithm
- Branch and bound on the network model
- Deterministic parallel backtrack search
- Branch and bound on the network model
- Parallel branch and bound on fine-grained hypercube multiprocessors
This page was built for publication: Deterministic branch-and-bound on distributed memory machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249013)