Branch-and-bound as a higher-order function

DOI10.1007/BF02073942zbMath0744.90072OpenAlexW1986831235MaRDI QIDQ1179748

V. J. Rayward-Smith, H. J. Turpin, G. P. McKeown

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02073942

zbMATH Keywords

traveling salesmanbranch-and-boundparallel implementationsSteiner tree problem in graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Related Items (2)

Parallel processing for difficult combinatorial optimization problems ⋮ Efficiency considerations in the implementation of parallel branch-and- bound

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• General branch and bound, and its relation to \(A^*\) and \(AO^*\)
• The general problem solving algorithm and its implementation
• A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions
• Worst-case performance of Rayward-Smith's Steiner tree heuristic
• A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
• An Automatic Method of Solving Discrete Programming Problems
• MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
• Anomalies in parallel branch-and-bound algorithms
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• On finding steiner vertices
• An SST-based algorithm for the steiner problem in graphs
• Branch-and-bound procedure and state—space representation of combinatorial optimization problems
• The computation of nearly minimal Steiner trees in graphs
• Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
• Branch-and-Bound Methods: A Survey
• A tree-search algorithm for mixed integer programming problems
• Letter to the Editor—A Note on the Branch-and-Bound Principle
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Branch-and-Bound Methods: General Formulation and Properties
• An algorithm for the steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs

This page was built for publication: Branch-and-bound as a higher-order function