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

DOI10.1016/0167-6377(88)90067-3MaRDI QIDQ1099088zbMATH OpenOpenAlexFDO

Authors E. A. Pruul, G. L. Nemhauser, 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

parallel processingbranch-and-boundtraveling salesman

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1163098
• Parallel processing for difficult combinatorial optimization problems
• Simple approaches to parallel branch and bound
• Anomalies in parallel branch-and-bound algorithms
• scientific article; zbMATH DE number 764414

Cites work

• scientific article; zbMATH DE number 3889284 (Why is no real title available?)
• 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
• An Algorithm for the Traveling Salesman Problem
• An introduction to parallelism in combinatorial optimization
• Anomalies in parallel branch-and-bound algorithms
• Branch-and-bound and parallel computation: A historical note
• Experiments with parallel algorithms for combinatorial problems
• MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
• Performance of parallel branch-and-bound algorithms
• Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem

Cited in

(11)

• Parallel best-first branch-and-bound in discrete optimization: a framework
• Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
• Large-scale 0-1 linear programming on distributed workstations
• An introduction to parallelism in combinatorial optimization
• Branch-and-bound and parallel computation: A historical note
• Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms
• Transient in a two-DOF nonlinear system
• 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
• Scheduling experiments on a nulear reactor using mixed integer programming
• Parallel processing for difficult combinatorial optimization problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099088)