Author:
Halder Swapna,Majumder Saibal,Biswas Arindam,Mandal Bijoy Kumar,Peng Sheng-Lung
Publisher
Springer Nature Singapore
Reference32 articles.
1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, New Jersey
2. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271
3. Floyd RW (1962) Algorithm 97: shortest path. Commun Assoc Comput Mach 5(6):345
4. Sedeño-Noda A, Raith A (2015) A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. Comput Oper Res 57:83–94
5. Shi N, Zhou S, Wang F, Tao Y, Liu L (2017) The multi-criteria constrained shortest path problem. Transp Res Part E Logistics Transp Rev 101:13–29