A hybrid genetic algorithm for the repetition free longest common subsequence problem
Mauro Castelli; Stefano Beretta; Leonardo Vanneschi
| Year of publication: |
2013
|
|---|---|
| Authors: | Castelli, Mauro ; Beretta, Stefano ; Vanneschi, Leonardo |
| Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 41.2013, 6, p. 644-649
|
| Subject: | Repetition free longest common subsequence | Heuristics | Genetic algorithms | Estimation of distribution algorithms | Evolutionärer Algorithmus | Evolutionary algorithm | Heuristik | Algorithmus | Algorithm | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming |
| Extent: | graph. Darst. |
|---|---|
| Type of publication: | Article |
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10010236062