An exact algorithm for the minimum quartet tree cost problem
Year of publication: |
2019
|
---|---|
Authors: | Consoli, Sergio ; Korst, Jan ; Geleijnse, Gijs ; Pauws, Steffen |
Published in: |
4OR : a quarterly journal of operations research. - Berlin, Heidelberg : Springer, ZDB-ID 2127815-5. - Vol. 17.2019, 4, p. 401-425
|
Subject: | Combinatorial optimization | Quartet trees | Minimum quartet tree cost | Exact solution algorithms | Cluster analysis | Graphs | Algorithmus | Algorithm | Graphentheorie | Graph theory | Clusteranalyse | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Extended formulations for perfect domination problems and their algorithmic implications
Forte, VinÃcius Leal do, (2023)
-
Combined neighborhood tabu search for community detection in complex networks
Gach, Olivier, (2016)
-
Population-based iterated greedy algorithm for the S-labeling problem
Lozano, Manuel, (2023)
- More ...
-
den Boef, Edgar, (2005)
-
Scheduling Periodic Tasks with Slack
Korst, Jan, (1997)
-
Korst, Jan, (1996)
- More ...