An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem.
Behnam BehdaniJ. Cole SmithPublished in: INFORMS J. Comput. (2014)
Keyphrases
- integer programming
- traveling salesman problem
- valid inequalities
- ant colony optimization
- combinatorial optimization
- linear programming
- optimization problems
- np hard
- cutting plane
- constraint programming
- network flow
- production planning
- column generation
- combinatorial problems
- combinatorial optimization problems
- lagrangian relaxation
- cutting plane algorithm
- hamiltonian cycle
- crossover operator
- integer program
- transportation networks
- vehicle routing problem
- evolutionary algorithm
- metaheuristic
- simulated annealing