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

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Carsten Witt Technische Universität Dortmund, Germany
Published in:
Cover Image
 
· Proceeding
GECCO '08 Proceedings of the 2008 GECCO conference companion on Genetic and evolutionary computation
Pages 2907-2946
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-60558-131-6 doi>10.1145/1388969.1389084
Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view Published by ACM 2008 Article
  • Tutorial
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 8
· Downloads (cumulative): 101
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder