Joksch, H. C. The shortest route problem with constraints. (English) Zbl 0135.20506 J. Math. Anal. Appl. 14, 191-197 (1966). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 37 Documents Keywords:operations research PDFBibTeX XMLCite \textit{H. C. Joksch}, J. Math. Anal. Appl. 14, 191--197 (1966; Zbl 0135.20506) Full Text: DOI References: [1] Pollack, M.; Wiebenson, W., Solutions of the shortest route problem—A review, Operations Res., 8, 224-230 (1960) · Zbl 0092.37905 [2] Pollack, M., Solutions of the \(k\)-th best route through a network—A review, J. Math. Anal. Appl., 3, 547-559 (1961) · Zbl 0112.12105 [3] Witzgall, C.; Goldman, A. J., Most profitable routing before maintenance, Bull. Operations Res. Soc. Am., B82 (1965) [4] Bellman, R., On a routing problem, Quart. Appl. Math., 16, 87-90 (1958) · Zbl 0081.14403 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.