Generalized multiple depot traveling salesmen problem - polyhedral study and exact algorithm.
Kaarthik SundarSivakumar RathinamPublished in: CoRR (2015)
Keyphrases
- np hard
- learning algorithm
- times faster
- dynamic programming
- cost function
- computational cost
- preprocessing
- improved algorithm
- computational complexity
- experimental study
- search space
- significant improvement
- optimal solution
- k means
- tree structure
- simulation study
- expectation maximization
- mobile robot
- matching algorithm
- worst case
- decision trees
- path planning
- high accuracy
- benchmark problems
- data sets
- detection algorithm
- segmentation algorithm
- graph cuts
- probabilistic model
- similarity measure
- experimental evaluation
- objective function
- search algorithm
- data streams