A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP
[chapter]
2015
Lecture Notes in Computer Science
We propose Hybrid Best First Search (HBFS), a search strategy for optimization problems that combines Best First Search (BFS) and Depth First Search (DFS). Like BFS, HBFS provides an anytime global lower bound on the optimum, while also providing anytime upper bounds, like DFS. Hence, it provides feedback on the progress of search and solution quality in the form of an optimality gap. In addition, it exhibits highly dynamic behavior that allows it to perform on par with methods like limited
doi:10.1007/978-3-319-23219-5_2
fatcat:ddtrz6o77fasje2n2xiadt3kdq