Crossover Operators for Multiobjective k-Subset Selection

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:9d5b14649706877cb44ebce7e5beae8d

MEINL, Thorsten, Michael R. BERTHOLD, 2009. Crossover Operators for Multiobjective k-Subset Selection. the 11th Annual conference. Montreal, Québec, Canada, 8. Jul 2009 - 12. Jul 2009. In: Proceedings of the 11th Annual conference on Genetic and evolutionary computation - GECCO '09. the 11th Annual conference. Montreal, Québec, Canada, 8. Jul 2009 - 12. Jul 2009. New York, New York, USA:ACM Press, pp. 1809. ISBN 978-1-60558-325-9

@inproceedings{Meinl2009Cross-5697, title={Crossover Operators for Multiobjective k-Subset Selection}, year={2009}, doi={10.1145/1569901.1570173}, isbn={978-1-60558-325-9}, address={New York, New York, USA}, publisher={ACM Press}, booktitle={Proceedings of the 11th Annual conference on Genetic and evolutionary computation - GECCO '09}, author={Meinl, Thorsten and Berthold, Michael R.} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5697"> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-sa/2.0/legalcode"/> <dcterms:title>Crossover Operators for Multiobjective k-Subset Selection</dcterms:title> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:26Z</dcterms:available> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5697"/> <dc:creator>Berthold, Michael R.</dc:creator> <dc:creator>Meinl, Thorsten</dc:creator> <dcterms:abstract xml:lang="eng">Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations used for TSP, the selection of a subset from a larger set has so far gained surprisingly little interest. One intriguing example of this type of problems occurs in diversity selection for virtual high throughput screening, where k molecules need to be selected from a set of n while optimizing certain constraints. In this paper we present a novel representation for k-subsets and several genetic operators for it.</dcterms:abstract> <dc:contributor>Berthold, Michael R.</dc:contributor> <dc:contributor>Meinl, Thorsten</dc:contributor> <dcterms:issued>2009</dcterms:issued> <dc:format>application/pdf</dc:format> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:26Z</dc:date> <dcterms:bibliographicCitation>First publ. in: GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, 2009, pp. 1809-1810</dcterms:bibliographicCitation> <dc:language>eng</dc:language> <dc:rights>deposit-license</dc:rights> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

meinl_crossover.pdf 58

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto