Edge-based representation beats vertex-based representation in shortest path problems
暂无分享,去创建一个
[1] Ingo Wegener,et al. Fitness Landscapes Based on Sorting and Shortest Paths Problems , 2002, PPSN.
[2] Thomas Stützle,et al. Ant Colony Optimization Theory , 2004 .
[3] Abdellah El-Fallahi,et al. A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem , 2008, Comput. Oper. Res..
[4] Frank Neumann,et al. Computing single source shortest paths using single-objective fitness , 2009, FOGA '09.
[5] Ingo Wegener,et al. The analysis of evolutionary algorithms on sorting and shortest paths problems , 2004, J. Math. Model. Algorithms.
[6] Benjamin Doerr,et al. A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem , 2007 .
[7] Jna. Note added in proof , 1980, The EMBO journal.
[8] Benjamin Doerr,et al. Drift analysis and linear functions revisited , 2010, IEEE Congress on Evolutionary Computation.
[9] Peter Sanders,et al. Fast Routing in Road Networks with Transit Nodes , 2007, Science.
[10] Sun Jin Kim,et al. Evolutionary algorithms for route selection and rate allocation in multirate multicast networks , 2007, Applied Intelligence.
[11] Benjamin Doerr,et al. Improved analysis methods for crossover-based algorithms , 2009, GECCO.
[12] Peter Sanders,et al. Computing Many-to-Many Shortest Paths Using Highway Hierarchies , 2007, ALENEX.
[13] Josef Stoer,et al. Numerische Mathematik 1 , 1989 .
[14] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[15] Ingo Wegener,et al. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem , 2004, Theor. Comput. Sci..
[16] Benjamin Doerr,et al. Crossover can provably be useful in evolutionary computation , 2008, GECCO '08.
[17] Peter Sanders,et al. Engineering highway hierarchies , 2012, JEAL.