Solving longest common subsequence problems via a transformation to the maximum clique problem
Christian Blum, Marko Djukanovic,Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günter R. Raidl
| Year of publication: |
2021
|
|---|---|
| Authors: | Blum, Christian ; Djukanovic, Marko ; Santini, Alberto ; Jiang, Hua ; Li, Chu-Min ; Manyà, Felip ; Raidl, Günter R. |
| 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. 125.2021, p. 1-17
|
| Subject: | Longest common subsequence | Transformation to maximum clique | Exact and heuristic solvers | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Theorie | Theory |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2020.105089 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012390324