Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means.
Zachary FriggstadKamyar KhodamoradiMohammad R. SalavatipourPublished in: CoRR (2018)
Keyphrases
- exact algorithms
- benchmark instances
- lower bound
- exact methods
- max sat
- k means
- exact solution
- knapsack problem
- linear programming relaxation
- lower and upper bounds
- upper bound
- vehicle routing problem with time windows
- approximation algorithms
- quadratic assignment problem
- np hard
- branch and bound algorithm
- benders decomposition
- optimal solution
- branch and bound
- heuristic methods
- combinatorial problems
- combinatorial optimization
- combinatorial optimization problems
- clustering algorithm
- objective function
- euclidean distance
- tabu search
- randomly generated
- lagrangian relaxation
- learning algorithm
- sat solvers
- linear program
- linear programming
- multi objective
- vc dimension
- cutting plane
- worst case
- scheduling problem
- dynamic programming
- search algorithm
- neural network
- finding optimal solutions