A branch-and-price algorithm for the Minimum Sum Coloring Problem.
Diego Delle DonneFabio FuriniEnrico MalagutiRoberto Wolfler CalvoPublished in: Discret. Appl. Math. (2021)
Keyphrases
- dynamic programming
- single pass
- computational complexity
- computational cost
- improved algorithm
- preprocessing
- times faster
- np hard
- learning algorithm
- computationally efficient
- particle swarm optimization
- selection algorithm
- matching algorithm
- ant colony optimization
- detection algorithm
- segmentation algorithm
- linear programming
- high accuracy
- significant improvement
- objective function
- classification algorithm
- experimental evaluation
- cost function
- convex hull
- memory requirements
- optimal solution
- estimation algorithm