3/2-approximation algorithm for two variants of a 2-depot Hamiltonian path problem.
Sivakumar RathinamRaja SenguptaPublished in: Oper. Res. Lett. (2010)
Keyphrases
- hamiltonian path
- experimental evaluation
- dynamic programming
- k means
- computational complexity
- input data
- optimization algorithm
- np hard
- theoretical analysis
- learning algorithm
- computational cost
- error bounds
- linear programming
- knapsack problem
- times faster
- classification algorithm
- tree structure
- detection algorithm
- particle swarm optimization
- neural network
- worst case
- approximation algorithms
- cost function
- genetic algorithm
- improved algorithm
- convex hull
- minimum cost
- approximation ratio
- error tolerance
- data structure
- matching algorithm
- segmentation algorithm
- expectation maximization
- markov random field
- probabilistic model
- objective function
- special case
- optimal solution
- search space
- preprocessing