1 paper · 1 filter
Olivier Laval, Sophie Toulouse, Anass Nagih
This article provides an overview of the performance and the theoretical complexity of approximate and exact methods for various versions of the shortest path problem. The proposed…