A new lower bound for the geometric traveling salesman problem in terms of discrepancy.
Stefan SteinerbergerPublished in: Oper. Res. Lett. (2010)
Keyphrases
- traveling salesman problem
- lower bound
- combinatorial optimization
- upper bound
- ant colony optimization
- ant colony optimization algorithm
- combinatorial optimization problems
- valid inequalities
- hamiltonian cycle
- optimization problems
- transportation networks
- vehicle routing problem
- genetic local search
- traveling salesman
- combinatorial problems
- branch and bound algorithm
- branch and bound
- crossover operator
- np hard
- integer programming
- linear programming relaxation
- optimal solution
- genetic algorithm
- subtour elimination
- objective function