On the refinement of bounds of heuristics algorithms of the traveling salesman poblem.
Bernd JerominFrank KörnerPublished in: Math. Program. (1987)
Keyphrases
- traveling salesman
- learning algorithm
- worst case analysis
- worst case
- computationally efficient
- neural network
- search algorithm
- upper bound
- average case
- upper and lower bounds
- approximation algorithms
- lin kernighan
- error bounds
- global optimization
- benchmark datasets
- computational complexity
- bayesian networks
- training data