Parallel best-first branch-and-bound in discrete optimization: a framework
From MaRDI portal
Publication:6560208
Cites work
- A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- A parallel branch and bound algorithm for the quadratic assignment problem
- A parallel integer linear programming algorithm
- An Algorithm for the Traveling Salesman Problem
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
- Anomalies in parallel branch-and-bound algorithms
- Branch-and-bound and parallel computation: A historical note
- Branch-and-Bound Methods: General Formulation and Properties
- Branch-and-bound procedure and state—space representation of combinatorial optimization problems
- Branch-and-Bound Strategies for Dynamic Programming
- Branching from the largest upper bound. Folklore and facts
- Divide-and-Conquer for Parallel Processing
- Dynamic Programming as Graph Searching: An Algebraic Approach
- General branch and bound, and its relation to A^* and AO^*
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 724213 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3804893 (Why is no real title available?)
- scientific article; zbMATH DE number 839542 (Why is no real title available?)
- scientific article; zbMATH DE number 934535 (Why is no real title available?)
- MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
- Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
- Performance of parallel branch-and-bound algorithms
- Random Trees and the Analysis of Branch and Bound Procedures
- Randomized parallel algorithms for backtrack search and branch-and-bound computation
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
- Simple approaches to parallel branch and bound
- Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
- 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: Parallel best-first branch-and-bound in discrete optimization: a framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560208)
