1 code implementation • 29 Jul 2022 • Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby, Mahdi Jalili
This paper leverages the recent state-of-the-art techniques in both constrained pathfinding and bi-objective search and presents two new solution approaches to the WCSPP on the basis of A* search, both capable of solving hard WCSPP instances on very large graphs.
no code implementations • 25 May 2021 • Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby
Bi-objective search is a well-known algorithmic problem, concerned with finding a set of optimal solutions in a two-dimensional domain.
