A branch-and-cut algorithm for the equicut problem.
Lorenzo BrunettaMichele ConfortiGiovanni RinaldiPublished in: Math. Program. (1997)
Keyphrases
- k means
- dynamic programming
- experimental evaluation
- detection algorithm
- times faster
- experimental study
- objective function
- selection algorithm
- computational complexity
- matching algorithm
- computational cost
- probabilistic model
- learning algorithm
- segmentation algorithm
- least squares
- classification algorithm
- simulated annealing
- high accuracy
- cost function
- significant improvement
- preprocessing
- convergence rate
- optimal solution
- space complexity
- single pass