A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives.
Laura BahienseYuri FrotaThiago F. NoronhaCelso C. RibeiroPublished in: Discret. Appl. Math. (2014)
Keyphrases
- improved algorithm
- dynamic programming
- theoretical analysis
- detection algorithm
- objective function
- computationally efficient
- experimental evaluation
- optimization algorithm
- path planning
- classification algorithm
- high accuracy
- worst case
- least squares
- knapsack problem
- expectation maximization
- significant improvement
- search space
- preprocessing
- optimal solution
- undirected graph
- recognition algorithm
- matching algorithm
- linear programming
- selection algorithm
- optimization procedure
- decomposition algorithm
- segmentation algorithm
- particle swarm optimization
- input data
- data sets
- simulated annealing
- knn
- probabilistic model
- k means
- computational complexity
- bayesian networks
- image segmentation
- genetic algorithm