Comparison of metaheuristics for the k-labeled spanning forest problem
Year of publication: |
May 2017
|
---|---|
Authors: | Consoli, Sergio ; Moreno Pérez, José Andrés ; Mladenovic, Nenad |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 24.2017, 3, p. 559-582
|
Subject: | combinatorial optimization | graphs and networks | k-labeled spanning forest | variable neighborhood search | intelligent optimization | minimum labeling spanning trees | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Forstwirtschaft | Forestry |
-
Allocating nodes to hubs for minimizing the hubs processing resources : a case study
Balma, Ali, (2019)
-
Laforest, Christian, (2013)
-
Constrained min-cut replication for K-way hypergraph partitioning
Yazici, Volkan, (2014)
- More ...
-
An exact algorithm for the minimum quartet tree cost problem
Consoli, Sergio, (2019)
-
Consoli, Sergio, (2017)
-
Variable neighbourhood search for the minimum labelling Steiner tree problem
Consoli, Sergio, (2009)
- More ...