ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view
Full text PdfPdf (2.95 MB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers table of contents
Montreal, Québec, Canada
TUTORIAL SESSION: Tutorials table of contents
Pages 3551-3592  
Year of Publication: 2009
ISBN:978-1-60558-505-5
Author
Carsten Witt  Technical University of Denmark, 2800 Kgs. Lyngby, Denmark
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 29,   Citation Count: 0
Additional Information:

index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1570256.1570430
What is a DOI?

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.m Miscellaneous


General Terms:
Algorithms, Performance, Theory


Keywords:
combinatorial optimisation, evolutionary algorithms, runtime analysis, theory, tutorial

Collaborative Colleagues:
Carsten Witt: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player