A branch-and-price algorithm for the robust graph coloring problem.
Claudia ArchettiNicola BianchessiAlain HertzPublished in: Discret. Appl. Math. (2014)
Keyphrases
- dynamic programming
- improved algorithm
- computationally efficient
- high accuracy
- experimental evaluation
- times faster
- theoretical analysis
- worst case
- cost function
- k means
- computational complexity
- estimation algorithm
- learning algorithm
- significant improvement
- np hard
- search space
- computational cost
- optimal solution
- linear programming
- particle swarm optimization
- similarity measure
- clustering method
- highly efficient
- convex hull
- object tracking algorithm
- path planning
- detection algorithm
- optimization algorithm
- expectation maximization
- objective function
- face recognition