%0 Journal Article
%T Rapport de recherche sur le probl¨¨me du plus court chemin contraint
%A Olivier Laval
%A Sophie Toulouse
%A Anass Nagih
%J Computer Science
%D 2008
%I arXiv
%X 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.
%U http://arxiv.org/abs/0803.2615v1