SIGN IN
SIGN UP
New insights into the OCST problem: integrating node degrees and their location in the graph
Full Text:
PDF
Buy this Article
Authors:
Wolfgang Steitz
University of Mainz, Mainz, Germany
Franz Rothlauf
University of Mainz, Mainz, Germany
Published in:
· Proceeding
GECCO '09
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Pages 357-364
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-325-9
doi>
10.1145/1569901.1569951
2009 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 14
· Downloads (cumulative): 88
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
GECCO '13
Share:
|
Tags:
algorithms
design
evolutionary algorithm
heuristic methods
heuristics
initialization
optimal communications spanning tree
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder