Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
暂无分享,去创建一个
[1] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[2] Mitsuo Gen,et al. Genetic algorithm approach on multi-criteria minimum spanning tree problem , 1999, Eur. J. Oper. Res..
[3] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[4] Bruce E. Hajek,et al. The time complexity of maximum matching by simulated annealing , 1988, JACM.
[5] M. Ehrgott. Approximation algorithms for combinatorial multicriteria optimization problems , 2000 .
[6] Mikio Kano,et al. Maximum andk-th maximal spanning trees of a weighted graph , 1987, Comb..
[7] Mark Jerrum,et al. The Metropolis Algorithm for Graph Bisection , 1998, Discret. Appl. Math..
[8] Bryant A. Julstrom,et al. Edge sets: an effective evolutionary coding of spanning trees , 2003, IEEE Trans. Evol. Comput..
[9] Ingo Wegener,et al. Evolutionary Algorithms and the Maximum Matching Problem , 2003, STACS.
[10] Mihalis Yannakakis,et al. On the complexity of local search , 1990, STOC '90.
[11] Hans-Paul Schwefel,et al. How to analyse evolutionary algorithms , 2002, Theor. Comput. Sci..
[12] Horst W. Hamacher,et al. On spanning tree problems with multiple objectives , 1994, Ann. Oper. Res..
[13] C. Greg Plaxton,et al. On the spanning trees of weighted graphs , 1988, Comb..
[14] Ingo Wegener,et al. Fitness Landscapes Based on Sorting and Shortest Paths Problems , 2002, PPSN.