A heuristic for the convex recoloring problem in graphs.
Ana Paula dos Santos DantasCid C. de SouzaZanoni DiasPublished in: Int. Trans. Oper. Res. (2022)
Keyphrases
- maximum independent set
- graph model
- graph mining
- optimal solution
- search algorithm
- minimum spanning tree
- graph representation
- convex optimization
- directed graph
- lower bound
- feasible solution
- graph theory
- tabu search
- knapsack problem
- heuristic methods
- dynamic programming
- simulated annealing
- convex relaxation
- exact algorithms
- tree search
- graph data
- convex sets
- piecewise linear
- graph structure
- solution quality