Exact algorithms and APX-hardness results for geometric packing and covering problems.
Timothy M. ChanElyot GrantPublished in: Comput. Geom. (2014)
Keyphrases
- exact algorithms
- approximation algorithms
- computational problems
- heuristic methods
- np hard
- combinatorial optimization problems
- knapsack problem
- neural network
- exact solution
- combinatorial optimization
- vehicle routing problem with time windows
- orders of magnitude
- optimization problems
- machine learning
- ant colony optimization
- np complete
- combinatorial problems
- worst case
- search algorithm
- np hardness