暂无分享,去创建一个
Frank Neumann | Benjamin Doerr | Daniel Johannsen | Timo Kötzing | Madeleine Theile | Benjamin Doerr | Timo Kötzing | F. Neumann | Daniel Johannsen | M. Theile
[1] Markus Schulze,et al. A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method , 2011, Soc. Choice Welf..
[2] Frank Neumann,et al. Computing single source shortest paths using single-objective fitness , 2009, FOGA '09.
[3] William F. Punch,et al. Crossover gene selection by spatial location , 2006, GECCO '06.
[4] Xin Yao,et al. Evolutionary Optimization , 2002 .
[5] Benjamin Doerr,et al. Improved analysis methods for crossover-based algorithms , 2009, GECCO.
[6] Maksud Ibrahimov,et al. Global Optimization in Supply Chain Operations , 2009, Natural Intelligence for Scheduling, Planning and Packing Problems.
[7] Markus Wagner,et al. Evolving Pacing Strategies for Team Pursuit Track Cycling , 2011, ArXiv.
[8] Frank Neumann,et al. Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms , 2008, PPSN.
[9] Dr. Zbigniew Michalewicz,et al. How to Solve It: Modern Heuristics , 2004 .
[10] Dirk Sudholt,et al. Running time analysis of Ant Colony Optimization for shortest path problems , 2012, J. Discrete Algorithms.
[11] Zbigniew Michalewicz,et al. Advances in Metaheuristics for Hard Optimization , 2008, Advances in Metaheuristics for Hard Optimization.
[12] Franz Rothlauf,et al. Network Random KeysA Tree Representation Scheme for Genetic and Evolutionary Algorithms , 2002, Evolutionary Computation.
[13] Dirk Sudholt,et al. How crossover helps in pseudo-boolean optimization , 2011, GECCO '11.
[14] Kurt Mehlhorn,et al. Review of algorithms and data structures: the basic toolbox by Kurt Mehlhorn and Peter Sanders , 2011, SIGA.
[15] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[16] Frank Neumann,et al. Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem , 2004, GECCO.
[17] El-Ghazali Talbi,et al. Metaheuristics - From Design to Implementation , 2009 .
[18] Kalyan Veeramachaneni,et al. Optimizing the Layout of 1000 Wind Turbines , 2011 .
[19] Zbigniew Michalewicz,et al. A Note on Usefulness of Geometrical Crossover for Numerical Optimization Problems , 1996, Evolutionary Programming.
[20] Ran Duan,et al. Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths , 2009, SODA.
[21] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[22] Luca Maria Gambardella,et al. A survey on metaheuristics for stochastic combinatorial optimization , 2009, Natural Computing.
[23] Zbigniew Michalewicz,et al. Advances in Metaheuristics for Hard Optimization (Natural Computing Series) , 2007 .
[24] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[25] Thomas Jansen,et al. The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help , 2002, Algorithmica.
[26] Carsten Witt,et al. Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models , 2007, Evolutionary Computation.
[27] Frank Neumann,et al. Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem , 2012, Algorithmica.
[28] Benjamin Doerr,et al. Crossover can provably be useful in evolutionary computation , 2008, GECCO '08.
[29] Thomas Jansen,et al. Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .
[30] Alberto Moraglio. Abstract convex evolutionary search , 2011, FOGA '11.
[31] Ingo Wegener,et al. The analysis of evolutionary algorithms on sorting and shortest paths problems , 2004, J. Math. Model. Algorithms.
[32] Franz Rothlauf,et al. Representations for genetic and evolutionary algorithms , 2002, Studies in Fuzziness and Soft Computing.
[33] Bryant A. Julstrom,et al. Edge sets: an effective evolutionary coding of spanning trees , 2003, IEEE Trans. Evol. Comput..
[34] Dirk Sudholt,et al. Running Time Analysis of ACO Systems for Shortest Path Problems , 2009, SLS.
[35] Joshua D. Knowles,et al. A comparison of encodings and algorithms for multiobjective minimum spanning tree problems , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).
[36] Kalyan Veeramachaneni,et al. Evolutionary optimization of flavors , 2010, GECCO '10.
[37] Anne Auger,et al. Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.
[38] Raphael Yuster,et al. All-pairs bottleneck paths for general graphs in truly sub-cubic time , 2007, STOC '07.
[39] A. E. Eiben,et al. Introduction to Evolutionary Computing , 2003, Natural Computing Series.
[40] Anton V. Eremeev,et al. Evolutionary algorithms and dynamic programming , 2009, GECCO.
[41] Tim Walters,et al. Repair and Brood Selection in the Traveling Salesman Problem , 1998, PPSN.
[42] Ingo Wegener,et al. Evolutionary Algorithms and the Maximum Matching Problem , 2003, STACS.
[43] Carsten Witt,et al. UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics , 2004 .
[44] Benjamin Doerr,et al. Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem , 2011, Evolutionary Computation.