Computational study of a branching algorithm for the maximum k-cut problem.
Vilmar Jefté Rodrigues de SousaMiguel F. AnjosSébastien Le DigabelPublished in: Discret. Optim. (2022)
Keyphrases
- times faster
- computational cost
- cost function
- search space
- np hard
- learning algorithm
- computational complexity
- simulated annealing
- improved algorithm
- experimental study
- detection algorithm
- segmentation algorithm
- experimental evaluation
- similarity measure
- neural network
- preprocessing
- search algorithm
- dynamic programming
- objective function
- clustering method
- maximum flow
- selection algorithm
- recognition algorithm
- simulation study
- convex hull
- reinforcement learning
- matching algorithm
- classification algorithm
- computationally efficient
- expectation maximization
- linear programming
- worst case
- probabilistic model
- k means