A Method for the Solution of the N th Best Path Problem
From MaRDI portal
Publication:3281415
DOI10.1145/320998.321004zbMath0100.13103MaRDI 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
Generalized dynamic programming methods in integer programming, An algorithm for ranking paths in acyclic networks, A dynamic programming algorithm to find all solutions in a neighborhood of the optimum, Solutions of the kth best route through a network. A review, Routing through a network with maximum reliability, Two-best solutions under distance constraints: The model and exemplary results for matroids, \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids, Finding the \(K\) shortest hyperpaths, Shortest-path algorithms: Taxonomy and annotation, Implementation of algorithms forK shortest loopless paths, An efficient algorithm for K shortest simple paths, Unnamed Item