Tight Continuous Relaxation of the Balanced k-Cut Problem.
Syama Sundar RangapuramPramod Kaushik MudrakartaMatthias HeinPublished in: NIPS (2014)
Keyphrases
- continuous relaxation
- mixed integer
- knapsack problem
- higher dimensional
- mixed integer linear programs
- lower bound
- linear programming
- upper bound
- worst case
- prune the search space
- feasible solution
- linear program
- network design problem
- optimal solution
- multidimensional knapsack problem
- quadratic program
- np hard
- mixed integer programming
- lot sizing
- transportation networks
- convex hull
- genetic algorithm