Placement of Loading Stations for Electric Vehicles: No Detours Necessary!
暂无分享,去创建一个
[1] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[2] Andrew V. Goldberg,et al. PHAST: Hardware-Accelerated Shortest Path Trees , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.
[3] Xiaowen Chu,et al. Electric vehicle charging station placement , 2013, 2013 IEEE International Conference on Smart Grid Communications (SmartGridComm).
[4] Andrew V. Goldberg,et al. PHAST: Hardware-accelerated shortest path trees , 2013, J. Parallel Distributed Comput..
[5] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[6] Wade Fagen-Ulmschneider,et al. Shortest Path , 2008, Encyclopedia of Algorithms.
[7] Peter Sanders,et al. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.
[8] Martin Leucker,et al. The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles , 2010, KI.
[9] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[10] Stefan Funke,et al. Ultrafast Shortest-Path Queries via Transit Nodes , 2006, The Shortest Path Problem.
[11] Andrew V. Goldberg,et al. Hierarchical Hub Labelings for Shortest Paths , 2012, ESA.
[12] Thomas A. Hennig,et al. The Shuttle Radar Topography Mission , 2001, Digital Earth Moving.
[13] Peter Sanders,et al. Transit Node Routing Reconsidered , 2013, SEA.
[14] Stefan Funke,et al. Enabling E-Mobility: Facility Location for Battery Loading Stations , 2013, AAAI.
[15] Stefan Funke,et al. Transit Nodes - Lower Bounds and Refined Construction , 2012, ALENEX.