R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network flows: theory, algorithms, and applications, 1993.

B. V. Cherkassky, A. V. Goldberg, and T. Radzik, Shortest paths algorithms: Theory and experimental evaluation, Mathematical programming, vol.73, issue.2, pp.129-174, 1996.

D. Delling, T. Pajor, D. Wagner, and C. Zaroliagis, Efficient Route Planning in Flight Networks, ATMOS, p.12, 2009.

E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math, vol.1, issue.1, pp.269-271, 1959.

T. L. Jacobs, L. A. Garrow, M. Lohatepanont, F. S. Koppelman, G. M. Coldren et al., Airline planning and schedule development, Quantitative Problem Solving Methods in the Airline Industry, pp.35-99, 2012.

M. Miler, D. Medak, and D. Odoba?i´odoba?i´c, The shortest path algorithm performance comparison in graph and relational database on a transportation network, Promet-Traffic&Transportation, vol.26, issue.1, pp.75-82, 2014.

I. Robinson, J. Webber, and E. Eifrem, Graph databases: new opportunities for connected data, 2015.

D. R. Shier and C. Witzgall, Arc tolerances in shortest path and network flow problems, Networks, vol.10, issue.4, pp.277-291, 1980.