References: Determination of shortest path in a network with time-dependent edge-lengths 1

Views

CrossRef citations to date

Altmetric

References

Ford , L.R. Jr and Fulkerson , D.R. 1956 . Maximal flow through a network . Canadian J. Math , 8 : 399 – 404 .
Google Scholar
Ford , L.R. Jr . 1956 . “ Network flow theory ” . In RAND Paper P-923 , Santa Monica Calif .
Google Scholar
Bellman , R. 1958 . On a routing problem . Quart. appL Math , 16 : 87 – 90 .
Google Scholar
Cooke , K.L. and Halsey , E. 1966 . The shortest route through a network with time-dependent mternodal transit times . J. math. Analysis Appl , 14 : 493 – 498 .
Web of Science ®Google Scholar
Klafszky , E. 1967 . Legrövidebb út Meghatározása idotöl fúggö élhossakkal birb hálózatban . Bulletin Computing Centre Hung., Acad. Sc , 14 ( 3 ) November
Google Scholar

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Determination of shortest path in a network with time-dependent edge-lengthsFootnote¹
¹This paper is the English version of the paper[5].

References

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

Determination of shortest path in a network with time-dependent edge-lengthsFootnote11This paper is the English version of the paper[5].

References

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date

Determination of shortest path in a network with time-dependent edge-lengthsFootnote¹
¹This paper is the English version of the paper[5].