Towards an abstract parallel branch and bound machine

DOI10.1007/BFB0027121MaRDI QIDQ6560207zbMATH OpenFDO

Authors Arie de Bruin, G. A. P. Kindervater, Harry W. J. M. Trienekens

Publication date 21 June 2024

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
• A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master–Slave Architecture
• An Algorithm for the Traveling Salesman Problem
• An Automatic Method of Solving Discrete Programming Problems
• Branch-and-bound as a higher-order function
• Branch-and-Bound Methods: A Survey
• Branch-and-Bound Methods: General Formulation and Properties
• Branch-and-bound procedure and state—space representation of combinatorial optimization problems
• Efficiency considerations in the implementation of parallel branch-and- bound
• General branch and bound, and its relation to A^* and AO^*
• Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
• ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Random Trees and the Analysis of Branch and Bound Procedures
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• Theoretical comparisons of search strategies in branch-and-bound algorithms

This page was built for publication: Towards an abstract parallel branch and bound machine

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