Branch-and-bound and parallel computation: A historical note

DOI10.1016/0167-6377(88)90067-3zbMath0637.90097MaRDI QIDQ1099088

Nemhauser, George I., E. A. Pruul, Russell A. Rushmeier

Publication date: 1988

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90067-3

zbMATH Keywords

traveling salesman; branch-and-bound; parallel processing

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

90C10: Integer programming

90C27: Combinatorial optimization

Related Items

Scheduling experiments on a nulear reactor using mixed integer programming, Large-scale 0-1 linear programming on distributed workstations, Transient in a two-DOF nonlinear system, An introduction to parallelism in combinatorial optimization, Branch-and-bound and parallel computation: A historical note, Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem, A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems, Parallel processing for difficult combinatorial optimization problems

Cites Work

• Unnamed Item
• An introduction to parallelism in combinatorial optimization
• Experiments with parallel algorithms for combinatorial problems
• Branch-and-bound and parallel computation: A historical note
• A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions
• A simulation tool for the performance evaluation of parallel branch and bound algorithms
• MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
• Performance of parallel branch-and-bound algorithms
• Anomalies in parallel branch-and-bound algorithms
• An Algorithm for the Traveling Salesman Problem
• Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem