Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem.
Jean-François CordeauGianpaolo GhianiEmanuela GuerrieroPublished in: Transp. Sci. (2014)
Keyphrases
- dynamic programming
- matching algorithm
- improved algorithm
- detection algorithm
- cost function
- high accuracy
- estimation algorithm
- computational complexity
- computationally efficient
- neural network
- selection algorithm
- recognition algorithm
- convergence rate
- clustering method
- segmentation algorithm
- simulated annealing
- data sets
- experimental evaluation
- preprocessing
- significant improvement
- data analysis
- computational cost
- genetic algorithm
- optimal solution
- convex hull
- face recognition
- classification algorithm
- tree structure
- np hard
- bayesian networks
- objective function
- search algorithm
- expectation maximization
- input data