A Method for the Solution of the N th Best Path Problem
From MaRDI portal
Publication:3281415
DOI10.1145/320998.321004zbMath0100.13103OpenAlexW2089845007MaRDI QIDQ3281415
Walter Hoffman, Richard Pavley
Publication date: 1959
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/320998.321004
Related Items (24)
Finding the k shortest paths in parallel ⋮ Optimal deployment of alternative fueling stations on transportation networks considering deviation paths ⋮ Multiple-path selection for new highway alignments using discrete algorithms ⋮ Enumerating \(K\) best paths in length order in DAGs ⋮ Solutions of the kth best route through a network. A review ⋮ Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations ⋮ Traffic graph convolutional network for dynamic urban travel speed estimation ⋮ Implementation of algorithms forK shortest loopless paths ⋮ An efficient time and space \(K\) point-to-point shortest simple paths algorithm ⋮ Generalized dynamic programming methods in integer programming ⋮ Routing through a network with maximum reliability ⋮ Shortest-path algorithms: Taxonomy and annotation ⋮ Finding the \(K\) shortest hyperpaths ⋮ The multiple shortest path problem with path deconfliction ⋮ A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs ⋮ An efficient implementation of an algorithm for findingK shortest simple paths ⋮ On the \(K\) shortest path trees problem ⋮ Two-best solutions under distance constraints: The model and exemplary results for matroids ⋮ \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids ⋮ DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS ⋮ An algorithm for ranking paths in acyclic networks ⋮ Ranking One Million Simple Paths in Road Networks ⋮ An efficient algorithm for K shortest simple paths ⋮ A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
This page was built for publication: A Method for the Solution of the N th Best Path Problem
