On the Shortest Route Through a Network

DOI10.1287/MNSC.6.2.187zbMath0995.90518OpenAlexW2058605898WikidataQ56078233 ScholiaQ56078233MaRDI QIDQ2768996

George B. Dantzig

Publication date: 22 October 2002

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.6.2.187

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (26)

Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network ⋮ The constrained shortest path problem with stochastic correlated link travel times ⋮ A simulated annealing for multi-criteria network path problems ⋮ A fully polynomial time approximation scheme for the probability maximizing shortest path problem ⋮ Dijkstra, Floyd and Warshall meet Kleene ⋮ Abstract interpretation of graphs ⋮ A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time ⋮ An efficient parallel algorithm for the all pairs shortest path problem ⋮ A new \(O(n^ 2)\) shortest chain algorithm ⋮ A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs ⋮ Finding real-valued single-source shortest paths in o(n 3) expected time ⋮ George Dantzig's impact on the theory of computation ⋮ Dynamic programming approaches to solve the shortest path problem with forbidden paths ⋮ Shortest-path queries in static networks ⋮ Über die Bestimmung minimaler Wege und Gerüste in Graphen ⋮ An algorithm of optimization for a special class of networks ⋮ Heuristic shortest path algorithms for transportation applications: state of the art ⋮ The multiple shortest path problem with path deconfliction ⋮ On the shortest path problem with negative cost cycles ⋮ The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm ⋮ The grid refinement technique ⋮ A generalized permanent label setting algorithm for the shortest path between specified nodes ⋮ Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen ⋮ A Forward-Backward Single-Source Shortest Paths Algorithm ⋮ Shortest paths in networks with vector weights ⋮ George B. Dantzig: a legendary life in mathematical programming

This page was built for publication: On the Shortest Route Through a Network