Fast and Exact Algorithms for Some NP-Hard 2-Clustering Problems in the One-Dimensional Case.
Alexander Kel'manovVladimir I. KhandeevPublished in: AIST (2019)
Keyphrases
- exact algorithms
- knapsack problem
- np hard
- approximation algorithms
- exact solution
- np complete
- computational problems
- benders decomposition
- worst case
- decision problems
- combinatorial optimization problems
- vehicle routing problem with time windows
- clustering algorithm
- clustering method
- combinatorial problems
- computational complexity
- optimal solution
- np hardness
- search methods
- integer programming
- scheduling problem
- max sat
- exact methods