Author:
Biswas Sudip,Ganguly Arnab,Shah Rahul
Publisher
Springer International Publishing
Reference18 articles.
1. Cai, X., Kloks, T., Wong, C.K.: Time-varying shortest path problems with constraints. Networks 29(3), 141–150 (1997)
2. Carlyle, W.M., Royset, J.O., Kevin Wood, R.: Lagrangian relaxation and enumeration for solving constrained shortest-path problems. Networks 52(4), 256–270 (2008)
3. Day, P.R., Ryan, D.M.: Flight attendant rostering for short-haul airline operations. Oper. Res. 45(5), 649–661 (1997)
4. Ergun, F., Sinha, R., Zhang, L.: An improved FPTAS for restricted shortest path. Inf. Process. Lett. 83(5), 287–291 (2002)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On temporal graph exploration;Journal of Computer and System Sciences;2021-08
2. The Temporal Explorer Who Returns to the Base;Lecture Notes in Computer Science;2019