A branch-and-cut algorithm for the connected max-k-cut problem.
Patrick HealyNicolas JozefowiezPierre LarocheFranc MarchettiSébastien MartinZsuzsanna RókaPublished in: Eur. J. Oper. Res. (2024)
Keyphrases
- cost function
- improved algorithm
- significant improvement
- learning algorithm
- recognition algorithm
- expectation maximization
- np hard
- computational complexity
- segmentation algorithm
- high accuracy
- single pass
- optimization algorithm
- input data
- optimal solution
- k means
- neural network
- objective function
- tree structure
- detection algorithm
- dynamic programming
- worst case
- probabilistic model
- particle swarm optimization
- computationally efficient
- preprocessing
- experimental evaluation
- segmentation method
- times faster
- selection algorithm
- decision trees
- computational cost