ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Martin Gruber Vienna University of Technology, Vienna, Austria
Jano van Hemert University of Edinburgh, Edinburgh, UK
Günther R. Raidl Vienna University of Technology, Vienna, Austria
Published in:
· Proceeding
GECCO '06 Proceedings of the 8th annual conference on Genetic and evolutionary computation
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-186-4 doi>10.1145/1143997.1144185
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 29
· Citation Count: 7


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 © 2012 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