Tight Continuous Relaxation of the Balanced k-Cut Problem.
Syama Sundar RangapuramPramod Kaushik MudrakartaMatthias HeinPublished in: CoRR (2015)
Keyphrases
- continuous relaxation
- knapsack problem
- higher dimensional
- mixed integer
- mixed integer linear programs
- linear programming
- lower bound
- upper bound
- prune the search space
- feasible solution
- linear program
- network design problem
- worst case
- optimal solution
- convex hull
- quadratic program
- cost function
- high dimensional
- support vector