CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Filters
3 research outputs found
Heuristic Algorithms for Solving Bounded Diameter Minimum Spanning Tree Problem and Its Application to Genetic Algorithm Development
Author
Huynh Thi Thanh Binh
Nguyen Duc Nghia
Publication venue
'IntechOpen'
Publication date
01/11/2008
Field of study
Get PDF
IntechOpen
Network design using genetic algorithm
Author
Anandkumar
Publication venue
Publication date
01/04/2010
Field of study
Get PDF
Etheses - A Saurashtra University Library Service