Solving the List Coloring Problem through a Branch-and-Price algorithm.
Mauro LucciDaniel E. SeverínGraciela L. NasiniPublished in: CoRR (2023)
Keyphrases
- cost function
- learning algorithm
- dynamic programming
- improved algorithm
- detection algorithm
- theoretical analysis
- computational cost
- computational complexity
- worst case
- significant improvement
- np hard
- preprocessing
- experimental evaluation
- high accuracy
- times faster
- matching algorithm
- objective function
- genetic algorithm
- recognition algorithm
- knapsack problem
- convergence rate
- clustering method
- face recognition
- optimization algorithm
- scheduling problem
- lower bound