Finding optimal route in the Romanian natural gas network

Dijkstra, E. (1959). A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 269-271.10.1007/BF01386390Search in Google Scholar

DNV KEMA Energy & Sustainability and COWI Belgium. (2013). Study on Entry-Exit Regimes in Gas. Groningen, The Netherlands: European Commission – DG ENERGY.Search in Google Scholar

Duffie, D., Garleanu, N., & Heje Pedersen, L. (2007). Valuation in Over-the-Counter Markets. The Review of Financial Studies, 1865-1900.10.1093/rfs/hhm037Search in Google Scholar

European Parliament and the European Council. (2009). Regulation (EU) No. 715/2009 on conditions for access to the natural gas transmission networks. Bruxelles, Belgium: European Parliament.Search in Google Scholar

European Parliament and the European Council. (2010). Regulation (EU) No. 994/2010 concerning measures to safeguard security of gas supply. Bruxelles, Belgium: European Parliament.Search in Google Scholar

Hochbaum, D. (2014). Lecture Notes for IEOR 266: Graph Algorithms and Network Flows - Section 8.9 Floyd-Warshall algorithm for all pairs shortest paths. Department of Industrial Engineering and Operations Research, University of California, Berkeley.Search in Google Scholar

Oxford Institute for Energy Studies. (December 2015). The evolution of European traded gas hubs. Oxford, UK: Oxford Institute for Energy Studies.Search in Google Scholar

Romanian Ministry of Energy. (2016, 10 05). Nota de fundamentare OUG 64/2016 pentru modificarea și completarea Legii energiei electrice și a gazelor naturale nr. 123/2012. Retrieved 03 02, 2017, from Guvernul Romaniei: http://gov.ro/ro/guvernulSearch in Google Scholar

SNTGN Transgaz SA Mediaș. (2014). Planul de Dezvoltare al Sistemului Național de Transport Gaze Naturale 2014-2023. Mediaș: SNTGN Transgaz SA.Search in Google Scholar

Sukumar, M., Madhumangal, P., & Tapan, P. K. (2003, March). An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs. Journal of Mathematical Modelling and Algorithms, 2(1), 57-65.Search in Google Scholar