Solutions of the Shortest-Route Problem—A Review

DOI10.1287/OPRE.8.2.224zbMATH Open0092.37905OpenAlexW2166553701WikidataQ56078251 ScholiaQ56078251MaRDI QIDQ3268735FDOQ3268735

Authors: Maurice Pollack, Walter Wiebenson 

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

Cited In (15)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3268735)