Building a parallel branch and bound library
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 201-231
Abstract
No abstract availableThis publication has 36 references indexed in Scilit:
- Branch-and-bound as a higher-order functionAnnals of Operations Research, 1991
- Large-scale 0–1 linear programming on distributed workstationsAnnals of Operations Research, 1990
- Parallel state-space search for a first solution with consistent linear speedupsInternational Journal of Parallel Programming, 1990
- Concurrent operations on priority queuesCommunications of the ACM, 1989
- The pairing heap: A new form of self-adjusting heapAlgorithmica, 1986
- An empirical comparison of priority-queue and event-set implementationsCommunications of the ACM, 1986
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984
- Efficient locking for concurrent operations on B-treesACM Transactions on Database Systems, 1981
- Concurrent manipulation of binary search treesACM Transactions on Database Systems, 1980
- Algorithm 230: Matrix PermutationCommunications of the ACM, 1964