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 | Algorithmus | Algorithm | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming |
-
Scalability of using restricted Boltzmann machines for combinatorial optimization
Probst, Malte, (2017)
-
Research trends in combinatorial optimization
Weinand, Jann Michael, (2022)
-
Lin, Lin, (2018)
- More ...
-
Castelli, Mauro, (2015)
-
Castelli, Mauro, (2014)
-
Castelli, Mauro, (2015)
- More ...