Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization-Reference-Cited by-同舟云学术

Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization

Published:2004 Issue: Volume: Page:21-30
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Briest Patrick,Brockhoff Dimo,Degener Bastian,Englert Matthias,Gunia Christian,Heering Oliver,Jansen Thomas,Leifhelm Michael,Plociennik Kai,Röglin Heiko,Schweer Andrea,Sudholt Dirk,Tannenbaum Stefan,Wegener Ingo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30217-9_3.pdf

Reference9 articles.

1. Atallah, M.J. (ed.): Algorithms and Theory of Computation Handbook. CRC Press, Boca Raton (1999)

2. Feige, U., Kilian, J.: Heuristics for semirandom graph problems. Journal of Computer and System Sciences 63, 639–671 (2000)

3. Feige, U., Krauthgamer, R.: Finding and certifying a large hidden clique in a semirandom graph. Random Structures and Algorithms 16, 195–208 (2000)

4. Feller, W.: An Introduction to Probability Theory and Its Applications. John Wiley & Sons, Chichester (1968)

5. Lecture Notes in Computer Science;O. Giel,2003

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics;Lecture Notes in Computer Science;2012

2. Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem;Algorithmica;2008-10-25

3. Minimum spanning trees made easier via multi-objective optimization;Natural Computing;2006-04-27

4. Can Single-Objective Optimization Profit from Multiobjective Optimization?;Natural Computing Series