Shortest path problem with forbidden paths: The elementary version

European Journal of Operational Research

Volumn 227, Issue 2, 2013, Pages 254-267

  Di Puglia Pugliese, Luigi ^a   Guerriero, Francesca ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Branch and bound approach; Combinatorial optimization; Dynamic programming approach; Forbidden paths; Shortest paths

Indexed keywords

BRANCH-AND-BOUND APPROACHES; FORBIDDEN PATHS; FORBIDDEN SET; RESOURCE CONSTRAINT; SHORTEST PATH; SHORTEST PATH PROBLEM; SINGLE ORIGIN; SOLUTION APPROACH; SOLUTION STRATEGY; TEST PROBLEM;

COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING;

GRAPH THEORY;

EID: 84873730959     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.11.010     Document Type: Article

References (17)

1. A.V. Aho, and M.J. Corasick Efficient string matching: an aid to bibliographic search Journal of the ACM 18 6 1975 333 340
2. O. Barndorff-Nielsen, and M. Sobel On the distribution of the number of admissible points in a vector random sample Theory of Probability and its Applications 11 2 1966 283 305
3. J.E. Beasley, and N. Christofides An algorithm for the resource constrained shortest path problem Networks 19 1989 379 394
4. J.L. Bentley, H.T. Kung, M. Schkolnick, and C.D. Thompson On the average number of maxima in a set of vectors and applications Journal of the ACM 25 4 1978 536 543
5. D.P. Bertsekas Network Optimization: Continuous and Discrete Models 1998 Athena Scientific
6. M. Desrochers, An Algorithm for the Shortest Path Problem with Resource Constraints, Technical Report G-88-27, GERAD, 1988.
7. L. Di Puglia Pugliese, F. Guerriero, Dynamic programming approaches to solve the shortest path problem with forbidden paths, Optimization Methods & Software, 2011. doi:10.1080/10556788.2011.630077.
8. F. Guerriero, L. Di Puglia Pugliese, Shortest Path Problem with Forbidden Paths: The Elementary Version, Technical Report 2/09, Laboratorio Logica, 2009. < http://uweb.deis.unical.it/dipugliapugliese/?page-id=2 >.
9. E. Gutierrez, and A.L. Medaglia Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks Annals of Operations Research 157 169-182 2008
10. S. Irnich Resource extension functions: properties, inversion and generalization to segments OR Spectrum 30 1 2008 113 148
11. S. Irnich, G. Desaulniers, Shortest Path Problems with Resource Constraints, Technical Report G-2004-11, Les Cahiers du GERAD, 2004.
12. D. Klingman, A. Napier, and J. Stutz Netgen: a program for generating large-scale (un)capacitated assignment, transportation, and minimum cost flow network problems Management Science 20 1974
13. E.Q.V. Martins An algorithm for ranking paths that may contain cycles European Journal of Operational Research 18 1984 123 130
14. U. Pape Implementation and efficiency of moore-Algorithm for the shortest path problem Mathematical Programming 7 1974 212 222
15. P. Van Mieghem Paths in the simple random graph and the Waxman graph Probability in the Engineering and Information Sciences 15 2001 535 555
16. P. Van Mieghem, and F.A. Kuipers On the complexity of QoS routing Computer Communications 26 2003 376 387
17. D. Villeneuve, and G. Desaulniers The shortest path problem with forbidden paths European Journal of Operational Research 165 1 2005 97 107