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

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

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

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 salesmanbranch-and-boundparallel processing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (10)

An introduction to parallelism in combinatorial optimization ⋮ Transient in a two-DOF nonlinear system ⋮ Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers ⋮ Branch-and-bound and parallel computation: A historical note ⋮ Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem ⋮ Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms ⋮ A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems ⋮ Scheduling experiments on a nulear reactor using mixed integer programming ⋮ Large-scale 0-1 linear programming on distributed workstations ⋮ 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

This page was built for publication: Branch-and-bound and parallel computation: A historical note