Building a parallel branch and bound library
From MaRDI portal
Publication:6560211
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 714538 (Why is no real title available?)
- scientific article; zbMATH DE number 749822 (Why is no real title available?)
- A new exact algorithm for the solution of quadratic assignment problems
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- A parallel integer linear programming algorithm
- Anomalies in parallel branch-and-bound algorithms
- Branch-and-bound as a higher-order function
- Concurrent Search and Insertion in AVL Trees
- Concurrent manipulation of binary search trees
- Concurrent search and insertion in 2-3 trees
- Efficient locking for concurrent operations on B-trees
- Implementation and Analysis of Binomial Queue Algorithms
- Large-scale 0-1 linear programming on distributed workstations
- MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
- Parallel heap: an optimal parallel priority queue
- Parallel state-space search for a first solution with consistent linear speedups
- Priority Search Trees
- QAPLIB-A quadratic assignment problem library
- Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
- Self-adjusting binary search trees
- The pairing heap: A new form of self-adjusting heap
This page was built for publication: Building a parallel branch and bound library
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560211)
