Solutions of the Shortest-Route Problem—A Review

DOI10.1287/opre.8.2.224zbMath0092.37905OpenAlexW2166553701WikidataQ56078251 ScholiaQ56078251MaRDI QIDQ3268735

Walter Wiebenson, Maurice Pollack

Publication date: 1960

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.8.2.224

zbMATH Keywords

applications of probability theory and statistics

Related Items (15)

Über ein Paradoxon aus der Verkehrsplanung ⋮ Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form ⋮ Solutions of the kth best route through a network. A review ⋮ Some constrained shortest-route problems ⋮ A combinatorial optimization problem: optimal generalized cycle bases ⋮ The problem of maximum flow with minimum attainable cost in a network ⋮ Shortest-path queries in static networks ⋮ A spectral approach to the shortest path problem ⋮ Some optimal path problems subject to improvements ⋮ Fuzzy logic based algorithms for maximum covering location problems ⋮ An analogue of Hoffman's circulation conditions for max-balanced flows ⋮ The shortest route problem with constraints ⋮ Bestimmung minimaler Wege in endlichen, gerichteten, bewerteten Graphen ⋮ Die Bestimmung kürzester Pfade in Graphen und passende Datenstrukturen ⋮ Implementation and efficiency of Moore-algorithms for the shortest route problem

This page was built for publication: Solutions of the Shortest-Route Problem—A Review