A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering.
Vera TraubThorben TröbstPublished in: IPCO (2020)
Keyphrases
- np hard
- dynamic programming
- experimental evaluation
- learning algorithm
- times faster
- search space
- optimal solution
- linear programming
- preprocessing
- k means
- significant improvement
- worst case
- computational cost
- objective function
- similarity measure
- single source
- optimization algorithm
- clustering method
- randomized approximation
- minimum volume
- routing problem
- recognition algorithm
- approximation algorithms
- benchmark problems
- combinatorial optimization
- closed form
- cost function
- segmentation algorithm
- expectation maximization
- bayesian networks
- simulated annealing
- genetic algorithm
- probabilistic model
- computational complexity