Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
From MaRDI portal
Publication:3686029
DOI10.1109/TSE.1985.232550zbMath0569.68027OpenAlexW2042192317MaRDI QIDQ3686029
Chee Fen Yu, Benjamin W.-S. Wah
Publication date: 1985
Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tse.1985.232550
depth-first searchsubproblemsapproximate stochastic modelaverage memory spacecombinatorially large problem space
Analysis of algorithms and problem complexity (68Q25) Mathematical programming (90C99) Algorithms in computer science (68W99)
Related Items (3)
Unnamed Item ⋮ Performance of linear-space search algorithms ⋮ Performance of linear-space search algorithms
This page was built for publication: Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search