Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem.
Ton VolgenantRoy JonkerPublished in: Comput. Oper. Res. (1990)
Keyphrases
- upper bound
- detection algorithm
- computational complexity
- optimal solution
- high accuracy
- times faster
- search space
- k means
- learning algorithm
- worst case
- significant improvement
- lower bound
- preprocessing
- objective function
- cost function
- np hard
- experimental evaluation
- improved algorithm
- recognition algorithm
- upper and lower bounds
- lower and upper bounds
- branch and bound
- average case
- matching algorithm
- classification algorithm
- theoretical analysis
- expectation maximization
- dynamic programming
- similarity measure