Halpern, J.; Priess, I. Shortest path with time constraints on movement and parking. (English) Zbl 0284.90077 Networks 4, 241-253 (1974). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 11 Documents MSC: 90C35 Programming involving graphs or networks 90B10 Deterministic network models in operations research PDF BibTeX XML Cite \textit{J. Halpern} and \textit{I. Priess}, Networks 4, 241--253 (1974; Zbl 0284.90077) Full Text: DOI OpenURL References: [1] Cooke, J. Math. Anal. and Appl. 14 pp 493– (1966) [2] Dijkstra, Numerische Mathematik 1 pp 269– (1959) [3] Dreyfus, Opns. Res. 17 pp 395– (1969) [4] and , Flows in Networks, Princeton University Press, 1962. [5] Kibby, Trans. Res. 3 pp 397– (1969) [6] Saksena, Opns. Res. 14 pp 909– (1966) 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.