Cyclic best first search: Using contours to guide branch‐and‐bound algorithms
From MaRDI portal
Publication:4632957
DOI10.1002/nav.21732zbMath1411.90232OpenAlexW2603457788MaRDI QIDQ4632957
Jason J. Sauppe, Jacobson, Sheldon H., Wenda Zhang, David R. Morrison, Edward C. Sewell
Publication date: 2 May 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21732
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (4)
An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints ⋮ Results for the close-enough traveling salesman problem with a branch-and-bound algorithm ⋮ Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search ⋮ Weighted network search games with multiple hidden objects and multiple search teams
This page was built for publication: Cyclic best first search: Using contours to guide branch‐and‐bound algorithms
