Computational experience with a SDP-based algorithm for maximum cut with limited unbalance.
Giulia GalbiatiStefano GualandiFrancesco MaffioliPublished in: Networks (2010)
Keyphrases
- experimental evaluation
- significant improvement
- worst case
- objective function
- computational complexity
- learning algorithm
- high accuracy
- computational cost
- np hard
- k means
- preprocessing
- clustering method
- simulated annealing
- linear programming
- segmentation algorithm
- shortest path
- expectation maximization
- recognition algorithm
- probabilistic model
- dynamic programming
- search space
- optimal solution
- similarity measure