An LP-based 3/2-approximation algorithm for the graphic s-t path TSP
Zhihan GaoPublished in: CoRR (2013)
Keyphrases
- np hard
- optimal solution
- dynamic programming
- experimental evaluation
- computational complexity
- search space
- linear programming
- computational cost
- ant colony optimization
- approximation ratio
- significant improvement
- detection algorithm
- combinatorial optimization
- probabilistic model
- preprocessing
- learning algorithm
- traveling salesman problem
- recognition algorithm
- times faster
- path planning
- matching algorithm
- approximation algorithms
- worst case
- optimization algorithm
- neural network
- expectation maximization
- high accuracy
- weight function
- optimal path
- shortest path problem
- theoretical analysis
- path length
- simplex method
- knapsack problem
- shortest path
- segmentation algorithm
- cost function
- search algorithm
- data structure
- genetic algorithm