Abstract
Previous article Next article Computing the N Best Loopless Paths in a NetworkS. Clarke, A. Krikorian, and J. RausenS. Clarke, A. Krikorian, and J. Rausenhttps://doi.org/10.1137/0111081PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Walter Hoffman and , Richard Pavley, A method for the solution of the Nth best path problem, J. Assoc. Comput. Mach., 6 (1959), 506–514 MR0129019 0100.13103 CrossrefISIGoogle Scholar[2] M. Pollack, Solutions of the kth best route through a network—A review, J. Math. Anal. and Appl., 3 (1961), 547–559 10.1016/0022-247X(61)90076-2 0112.12105 CrossrefGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Volume 11, Issue 4| 1963Journal of the Society for Industrial and Applied Mathematics History Submitted:26 December 1962Published online:13 July 2006 InformationCopyright © 1963 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0111081Article page range:pp. 1096-1102ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
