A heuristic for the convex recoloring problem in graphs
Year of publication: |
2022
|
---|---|
Authors: | Dantas, Ana Paula S. ; Souza, Cid C. de ; Dias, Zanoni |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 29.2022, 3, p. 1454-1478
|
Subject: | combinatorial optimization | convex recoloring | GRASP | Heuristik | Heuristics | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Constrained min-cut replication for K-way hypergraph partitioning
Yazici, Volkan, (2014)
-
Laforest, Christian, (2013)
-
Combined neighborhood tabu search for community detection in complex networks
Gach, Olivier, (2016)
- More ...
-
A heuristic for the convex recoloring problem in graphs
Dantas, Ana Paula S., (2020)
-
Distances in multimedia phylogeny
Oikawa, Marina A., (2016)
-
Scheduling activities at oil wells with resource displacement
Moura, Arnaldo V., (2008)
- More ...