On some large-scale LP relaxations for the Graph Partitioning Problem and their optimal solutions.
Michel MinouxPublished in: Ann. Oper. Res. (1995)
Keyphrases
- graph partitioning
- lp relaxation
- optimal solution
- linear programming
- message passing
- linear program
- image segmentation
- graph model
- feasible solution
- energy minimization
- clustering algorithm
- weighted graph
- integer programming
- knapsack problem
- data clustering
- integer program
- np hard
- spectral clustering
- global optimum
- global constraints
- objective function
- valid inequalities
- scheduling problem
- simulated annealing
- data objects
- search space
- distributed systems
- computer vision