Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
From MaRDI portal
Recommendations
Cited in
(14)- Modélisation d'algorithmes d'optimisation à stratégie aléatoire. (Modelling random search optimization algorithms)
- Are branch and bound and A\(^{\ast}\) algorithms identical?
- Combining interval branch and bound and stochastic search
- The hierarchical model of branch planning with random coefficients
- scientific article; zbMATH DE number 3947999 (Why is no real title available?)
- scientific article; zbMATH DE number 4068619 (Why is no real title available?)
- scientific article; zbMATH DE number 1334602 (Why is no real title available?)
- scientific article; zbMATH DE number 1935510 (Why is no real title available?)
- State-Space Search
- scientific article; zbMATH DE number 3892936 (Why is no real title available?)
- Performance of linear-space search algorithms
- Performance of linear-space search algorithms
- Parallel best-first branch-and-bound in discrete optimization: a framework
- Multiple stack branch and bound
This page was built for publication: Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686029)