Fischer, F., & Helmberg, C. (2014). Dynamic graph generation for the shortest path problem in time expanded networks. Mathematical programming, 143(1-2), 257-297. https://doi.org/10.1007/s10107-012-0610-3
Citace podle Chicago (17th ed.)Fischer, Frank, a Christoph Helmberg. "Dynamic Graph Generation for the Shortest Path Problem in Time Expanded Networks." Mathematical Programming 143, no. 1-2 (2014): 257-297. https://doi.org/10.1007/s10107-012-0610-3.
Citace podle MLA (9th ed.)Fischer, Frank, a Christoph Helmberg. "Dynamic Graph Generation for the Shortest Path Problem in Time Expanded Networks." Mathematical Programming, vol. 143, no. 1-2, 2014, pp. 257-297, https://doi.org/10.1007/s10107-012-0610-3.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..