Integer Programming Formulation of Traveling Salesman Problems.
C. E. MillerA. W. TuckerR. A. ZemlinPublished in: J. ACM (1960)
Keyphrases
- traveling salesman problem
- integer programming formulation
- valid inequalities
- randomly generated problems
- combinatorial optimization
- randomly generated
- ant colony optimization
- linear programming relaxation
- optimization problems
- combinatorial optimization problems
- lp relaxation
- vehicle routing problem
- neighborhood search
- scheduling problem
- branch and bound algorithm
- neural network
- metaheuristic
- tabu search algorithm