论文信息 - Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view - 字舞流文

Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view

[1] Dirk Sudholt,et al. On the runtime analysis of the 1-ANT ACO algorithm , 2007, GECCO '07.

[2] Ingo Wegener,et al. Real royal road functions for constant population size , 2003, Theor. Comput. Sci..

[3] Mark Jerrum,et al. Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.

[4] Gregory B. Sorkin,et al. Efficient simulated annealing on fractal energy landscapes , 1991, Algorithmica.

[5] Frank Neumann,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Runtime Analysis of a Simple Ant Colony Optimization Algorithm Runtime Analysis of a Simple Ant Colony Optimization Algorithm , 2022 .

[6] Ingo Wegener,et al. Real royal road functions--where crossover provably is essential , 2001, Discret. Appl. Math..

[7] Ingo Wegener,et al. Simulated Annealing Beats Metropolis in Combinatorial Optimization , 2005, ICALP.