The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case.
Vladimir G. DeinekoRené van DalGünter RotePublished in: Inf. Process. Lett. (1994)
Keyphrases
- traveling salesman problem
- convex hull
- valid inequalities
- combinatorial optimization
- convex sets
- ant colony optimization
- convex polyhedra
- optimization problems
- traveling salesman
- mixed integer
- special case
- hamiltonian cycle
- feasible solution
- neural network
- transportation networks
- point sets
- satisfy the triangle inequality
- extreme points
- vehicle routing problem
- np complete
- simple polygon
- subtour elimination
- linear programming
- simulated annealing
- np hard
- computational complexity
- learning algorithm
- machine learning