Experiments with parallel algorithms for combinatorial problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 4027472 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Theorem on Boolean Matrices
- A note on two problems in connexion with graphs
Cited in
(9)- An extension of labeling techniques for finding shortest path trees
- From the theory to the tools: parallel dynamic programming
- Branch-and-bound and parallel computation: A historical note
- Experiments with parallel branch-and-bound algorithms for the set covering problem
- Conflicting criteria, cooperating processors - some experiments on implementing a multicriteria decision support method on a parallel computer
- A parallel branch and bound algorithm for the quadratic assignment problem
- Solving knapsack problems on GPU
- Performance evaluation of vector implementations of combinatorial algorithms
- Parallel processing for difficult combinatorial optimization problems
This page was built for publication: Experiments with parallel algorithms for combinatorial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095034)