An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
From MaRDI portal
Publication:1072940
DOI10.1007/BF01939360zbMath0587.90094MaRDI QIDQ1072940
Narsingh Deo, Michael J. Quinn
Publication date: 1986
Published in: BIT (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10)
Related Items (2)
Performances of parallel branch and bound algorithms with best-first search ⋮ Large-scale 0-1 linear programming on distributed workstations
Cites Work
- Unnamed Item
- Anomalies in parallel branch-and-bound algorithms
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- An Algorithm for the Traveling Salesman Problem
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
- Tree-search algorithms for quadratic assignment problems
- The traveling-salesman problem and minimum spanning trees: Part II
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case
This page was built for publication: An upper bound for the speedup of parallel best-bound branch-and-bound algorithms