A hybrid genetic algorithm for the repetition free longest common subsequence problem
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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
An adaptive penalty guided genetic algorithm for scheduling parallel batch processing machines
Xu, Shubin, (2018)
-
Celikbilek, Can, (2016)
-
Refined ranking relations for selection of solutions in multi objective metaheuristics
Moritz, Ruby L. V., (2015)
- More ...
-
Castelli, Mauro, (2015)
-
Castelli, Mauro, (2015)
-
Hájek, Petr, (2019)
- More ...