Anytime algorithms for the longest common palindromic subsequence problem
Year of publication: |
2020
|
---|---|
Authors: | Djukanovic, Marko ; Raidl, Günther ; Blum, Christian |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 114.2020, p. 1-20
|
Subject: | A* search | Anytime algorithms | Beam search | Hybrid algorithms | The longest common palindromic subsequence problem | Algorithmus | Algorithm | Theorie | Theory | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming |
-
Pecora, Jose Eduardo, (2016)
-
Li, Zixiang, (2021)
-
A beam search algorithm for the biobjective container loading problem
Araya, Ignacio, (2020)
- More ...
-
Solving longest common subsequence problems via a transformation to the maximum clique problem
Blum, Christian, (2021)
-
Prüfer Numbers: A Poor Presentation of Spanning Trees for Evolutionary Search
Gottlieb, Jens, (2000)
-
Decomposition based hybrid metaheuristics
Raidl, Günther, (2015)
- More ...