Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computer Networks and Communications,Software
Reference54 articles.
1. Ahuja RK, Magnanti TL, Orlin JB (1988) Network flows-theory, algorithms and applications. Pearson; 1st edition
2. Andreatta G, Romeo L (1988) Stochastic shortest paths with recourse. Networks 18(3):193–204
3. Belenky P (2011) Revised departmental guidance on valuation of travel time in economic analysis. Tech. rep., U.S. Department of Transportation. https://www.transportation.gov/sites/dot.dev/files/docs/
vot% guidance 092811c.pdf
4. Bertsekas DP (2012) Dynamic programming and optimal control, 4th edn. Athena Scientific, Belmont, Massachusetts. http://www.athenasc.com/dpbook.html
5. Boyles SD, Rambha T (2016) A note on detecting unbounded instances of the online shortest path problem. Networks 67(4):270–276
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献