A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality.
Usha MohanSivaramakrishnan RamaniSounaka MishraPublished in: Discret. Appl. Math. (2019)
Keyphrases
- optimal solution
- ant colony optimization
- computational complexity
- np hard
- dynamic programming
- triangle inequality
- data sets
- nearest neighbor
- knapsack problem
- combinatorial optimization
- simulated annealing
- k means
- segmentation algorithm
- similarity function
- search space
- quadratic assignment problem
- objective function