An improved upper bound for the TSP in cubic 3-edge-connected graphs.
David GamarnikMoshe LewensteinMaxim SviridenkoPublished in: Oper. Res. Lett. (2005)
Keyphrases
- upper bound
- lower bound
- connected graphs
- traveling salesman problem
- edge detection
- branch and bound
- lower and upper bounds
- travelling salesman
- worst case
- edge information
- ant colony optimization
- upper and lower bounds
- np hard
- b spline
- optimal solution
- generalization error
- data sets
- optimization problems
- real time
- combinatorial optimization
- branch and bound algorithm
- genetic algorithm
- markov random field
- weighted graph
- similarity measure
- case study
- image gradient
- information retrieval