New lower bounds for the Symmetric Travelling Salesman Problem.
Giorgio CarpanetoMatteo FischettiPaolo TothPublished in: Math. Program. (1989)
Keyphrases
- lower bound
- quadratic assignment problem
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- objective function
- lower and upper bounds
- worst case
- lower bounding
- optimal solution
- vc dimension
- upper and lower bounds
- lagrangian relaxation
- linear programming relaxation
- concept class
- positive definite
- cutting plane
- randomly generated problems
- ant colony optimisation
- iterated local search