Article ID: | iaor20061808 |
Country: | Netherlands |
Volume: | 165 |
Issue: | 1 |
Start Page Number: | 97 |
End Page Number: | 107 |
Publication Date: | Aug 2005 |
Journal: | European Journal of Operational Research |
Authors: | Desaulniers Guy, Villeneuve Daniel |
We consider a variant of the constrained shortest path problem, where the constraints come from a set of forbidden paths (arc sequences) that cannot be part of any feasible solution. Two solution approaches are proposed for this variant. The first uses Aho and Corasick's keyword matching algorithm to filter paths produced by a