Rapport de recherche sur le probl\`eme du plus court chemin contraint

TL;DR

This paper reviews the performance and complexity of methods for different shortest path problems and aims to improve solving a broader covering problem using column generation with shortest path as a sub-problem.

Contribution

It offers an overview of existing methods and proposes an approach to enhance solving a general covering problem via column generation.

Findings

Analysis of approximate and exact shortest path methods

Insights into the theoretical complexity of these methods

Proposed improvements for solving covering problems

Abstract

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 study aims to improve the resolution of a more general covering problem within a column generation scheme in which the shortest path problem is the sub-problem.