A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem.
Diego Delle DonneJavier MarencoPublished in: Discret. Optim. (2011)
Keyphrases
- learning algorithm
- dynamic programming
- objective function
- optimal solution
- detection algorithm
- preprocessing
- theoretical analysis
- times faster
- computational complexity
- improved algorithm
- significant improvement
- worst case
- input data
- selection algorithm
- experimental evaluation
- optimization algorithm
- linear programming
- minimum length
- data sets
- segmentation algorithm
- square error
- particle swarm optimization
- high accuracy
- probabilistic model
- np hard
- multi objective
- k means
- search space
- data structure
- feature selection