Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/39700
DC FieldValue
dc.titleA fixed-length subset genetic algorithm for the p-median problem
dc.contributor.authorLim, A.
dc.contributor.authorXu, Z.
dc.date.accessioned2013-07-04T07:47:34Z
dc.date.available2013-07-04T07:47:34Z
dc.date.issued2003
dc.identifier.citationLim, A.,Xu, Z. (2003). A fixed-length subset genetic algorithm for the p-median problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2724 : 1596-1597. ScholarBank@NUS Repository.
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39700
dc.description.abstractIn this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the classical p-median problem indicate that our method is superior and very close to the optimal solution. © Springer-Verlag Berlin Heidelberg 2003.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume2724
dc.description.page1596-1597
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

96
checked on May 5, 2021

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.