Lee, Jisun; Joung, Seulgi; Lee, Kyungsik A fully polynomial time approximation scheme for the probability maximizing shortest path problem. (English) Zbl 1495.90226 Eur. J. Oper. Res. 300, No. 1, 35-45 (2022). MSC: 90C35 90C15 90C27 68Q25 PDF BibTeX XML Cite \textit{J. Lee} et al., Eur. J. Oper. Res. 300, No. 1, 35--45 (2022; Zbl 1495.90226) Full Text: DOI
Hughes, Michael S.; Lunday, Brian J.; Weir, Jeffrey D.; Hopkinson, Kenneth M. The multiple shortest path problem with path deconfliction. (English) Zbl 1487.90621 Eur. J. Oper. Res. 292, No. 3, 818-829 (2021). MSC: 90C35 90B06 90B10 90C29 90C27 PDF BibTeX XML Cite \textit{M. S. Hughes} et al., Eur. J. Oper. Res. 292, No. 3, 818--829 (2021; Zbl 1487.90621) Full Text: DOI
Wang, Li; Yang, Lixing; Gao, Ziyou The constrained shortest path problem with stochastic correlated link travel times. (English) Zbl 1346.90187 Eur. J. Oper. Res. 255, No. 1, 43-57 (2016). MSC: 90B06 90C09 90C10 90C11 90C15 90C35 PDF BibTeX XML Cite \textit{L. Wang} et al., Eur. J. Oper. Res. 255, No. 1, 43--57 (2016; Zbl 1346.90187) Full Text: DOI
Di Puglia Pugliese, Luigi; Guerriero, Francesca On the shortest path problem with negative cost cycles. (English) Zbl 1339.90323 Comput. Optim. Appl. 63, No. 2, 559-583 (2016). MSC: 90C35 90C39 PDF BibTeX XML Cite \textit{L. Di Puglia Pugliese} and \textit{F. Guerriero}, Comput. Optim. Appl. 63, No. 2, 559--583 (2016; Zbl 1339.90323) Full Text: DOI
Wilson, David B.; Zwick, Uri A forward-backward single-source shortest paths algorithm. (English) Zbl 1327.68138 SIAM J. Comput. 44, No. 3, 698-739 (2015). MSC: 68Q25 05C80 05C85 68Q87 PDF BibTeX XML Cite \textit{D. B. Wilson} and \textit{U. Zwick}, SIAM J. Comput. 44, No. 3, 698--739 (2015; Zbl 1327.68138) Full Text: DOI arXiv
Sommer, Christian Shortest-path queries in static networks. (English) Zbl 1305.68137 ACM Comput. Surv. 46, No. 4, Paper No. 45, 31 p. (2014). MSC: 68R10 05C12 05C38 05C82 05-02 68-02 PDF BibTeX XML Cite \textit{C. Sommer}, ACM Comput. Surv. 46, No. 4, Paper No. 45, 31 p. (2014; Zbl 1305.68137) Full Text: DOI
Di Puglia Pugliese, Luigi; Guerriero, Francesca Dynamic programming approaches to solve the shortest path problem with forbidden paths. (English) Zbl 1271.90093 Optim. Methods Softw. 28, No. 2, 221-255 (2013). MSC: 90C35 90C39 PDF BibTeX XML Cite \textit{L. Di Puglia Pugliese} and \textit{F. Guerriero}, Optim. Methods Softw. 28, No. 2, 221--255 (2013; Zbl 1271.90093) Full Text: DOI
Takaoka, Tadao A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time. (English) Zbl 1268.90072 J. Comb. Optim. 25, No. 2, 326-337 (2013). MSC: 90C27 90C35 90C60 PDF BibTeX XML Cite \textit{T. Takaoka}, J. Comb. Optim. 25, No. 2, 326--337 (2013; Zbl 1268.90072) Full Text: DOI
Liu, Linzhong; Mu, Haibo; Luo, Haiyan; Li, Xiaojing A simulated annealing for multi-criteria network path problems. (English) Zbl 1349.90861 Comput. Oper. Res. 39, No. 12, 3119-3135 (2012). MSC: 90C59 90C35 90C29 90B10 PDF BibTeX XML Cite \textit{L. Liu} et al., Comput. Oper. Res. 39, No. 12, 3119--3135 (2012; Zbl 1349.90861) Full Text: DOI
Höfner, Peter; Möller, Bernhard Dijkstra, Floyd and Warshall meet Kleene. (English) Zbl 1259.68243 Formal Asp. Comput. 24, No. 4-6, 459-476 (2012). MSC: 68W30 16Y60 08A70 PDF BibTeX XML Cite \textit{P. Höfner} and \textit{B. Möller}, Formal Asp. Comput. 24, No. 4--6, 459--476 (2012; Zbl 1259.68243) Full Text: DOI Link
Karp, Richard M. George Dantzig’s impact on the theory of computation. (English) Zbl 1151.90527 Discrete Optim. 5, No. 2, 174-185 (2008). MSC: 90C27 90C49 90C05 90C10 PDF BibTeX XML Cite \textit{R. M. Karp}, Discrete Optim. 5, No. 2, 174--185 (2008; Zbl 1151.90527) Full Text: DOI
Fu, L.; Sun, D.; Rilett, L. R. Heuristic shortest path algorithms for transportation applications: state of the art. (English) Zbl 1113.90034 Comput. Oper. Res. 33, No. 11, 3324-3343 (2006). MSC: 90B20 90B10 90C59 90B06 PDF BibTeX XML Cite \textit{L. Fu} et al., Comput. Oper. Res. 33, No. 11, 3324--3343 (2006; Zbl 1113.90034) Full Text: DOI
Cottle, Richard W. George B. Dantzig: a legendary life in mathematical programming. (English) Zbl 1085.01020 Math. Program. 105, No. 1 (A), 1-8 (2006). MSC: 01A70 90C99 90-03 PDF BibTeX XML Cite \textit{R. W. Cottle}, Math. Program. 105, No. 1 (A), 1--8 (2006; Zbl 1085.01020) Full Text: DOI
Kolliopoulos, Stavros G.; Stein, Clifford Finding real-valued single-source shortest paths in \(o(n^3)\) expected time. (English) Zbl 1415.90137 Cunningham, W. H. (ed.) et al., Integer programming and combinatorial optimization. 5th international IPCO conference, Vancouver, Canada, June 3–5, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1084, 94-104 (1996). MSC: 90C35 PDF BibTeX XML Cite \textit{S. G. Kolliopoulos} and \textit{C. Stein}, Lect. Notes Comput. Sci. 1084, 94--104 (1996; Zbl 1415.90137) Full Text: DOI
Helgason, Richard V.; Kennington, Jeffery L.; Stewart, B. Douglas The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm. (English) Zbl 0776.90083 Comput. Optim. Appl. 2, No. 1, 47-75 (1993). MSC: 90C35 65Y05 90-08 PDF BibTeX XML Cite \textit{R. V. Helgason} et al., Comput. Optim. Appl. 2, No. 1, 47--75 (1993; Zbl 0776.90083) Full Text: DOI
Waissi, Gary R. A new \(O(n^ 2)\) shortest chain algorithm. (English) Zbl 0696.68077 Appl. Math. Comput. 37, No. 2, 111-120 (1990). MSC: 68Q25 68R10 68N99 PDF BibTeX XML Cite \textit{G. R. Waissi}, Appl. Math. Comput. 37, No. 2, 111--120 (1990; Zbl 0696.68077) Full Text: DOI
Corley, H. W.; Moon, I. D. Shortest paths in networks with vector weights. (English) Zbl 0542.90099 J. Optimization Theory Appl. 46, 79-86 (1985). MSC: 90C35 90C31 PDF BibTeX XML Cite \textit{H. W. Corley} and \textit{I. D. Moon}, J. Optim. Theory Appl. 46, 79--86 (1985; Zbl 0542.90099) Full Text: DOI
Jeyaratnam, S. A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs. (English) Zbl 0502.90083 Eur. J. Oper. Res. 12, 375-378 (1983). MSC: 90C35 05C35 PDF BibTeX XML Cite \textit{S. Jeyaratnam}, Eur. J. Oper. Res. 12, 375--378 (1983; Zbl 0502.90083) Full Text: DOI
Osyczka, A. An algorithm of optimization for a special class of networks. (English) Zbl 0329.90066 Computing 16, 77-97 (1976). MSC: 90C35 90C10 90B10 68W99 65K05 PDF BibTeX XML Cite \textit{A. Osyczka}, Computing 16, 77--97 (1976; Zbl 0329.90066) Full Text: DOI
Jung, H. A. Über die Bestimmung minimaler Wege und Gerüste in Graphen. (German) Zbl 0303.65061 Computing 13, 249-252 (1974). MSC: 65K05 68W99 05-04 PDF BibTeX XML Cite \textit{H. A. Jung}, Computing 13, 249--252 (1974; Zbl 0303.65061) Full Text: DOI
Domschke, W. Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen. (German) Zbl 0262.90062 Computing 11, 125-136 (1973). MSC: 90C35 05C35 PDF BibTeX XML Cite \textit{W. Domschke}, Computing 11, 125--136 (1973; Zbl 0262.90062) Full Text: DOI
Nemhauser, George L. A generalized permanent label setting algorithm for the shortest path between specified nodes. (English) Zbl 0234.90063 J. Math. Anal. Appl. 38, 328-334 (1972). MSC: 90C35 PDF BibTeX XML Cite \textit{G. L. Nemhauser}, J. Math. Anal. Appl. 38, 328--334 (1972; Zbl 0234.90063) Full Text: DOI
Braddock, R. D. The grid refinement technique. (English) Zbl 0203.48702 J. Optimization Theory Appl. 7, 337-345 (1971). PDF BibTeX XML Cite \textit{R. D. Braddock}, J. Optim. Theory Appl. 7, 337--345 (1971; Zbl 0203.48702) Full Text: DOI