Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations.
T. H. C. SmithT. W. S. MeyerGerald L. ThompsonPublished in: Discret. Appl. Math. (1990)
Keyphrases
- lower bound
- quadratic assignment problem
- upper bound
- branch and bound
- np hard
- branch and bound algorithm
- worst case
- lower bounding
- optimal solution
- objective function
- lower and upper bounds
- upper and lower bounds
- upper bounding
- ant colony optimisation
- lagrangian relaxation
- sample size
- online learning
- simulated annealing
- cutting plane
- network design problem
- special case
- learning algorithm