Generating subtour elimination constraints for the TSP from pure integer solutions.

Ulrich Pferschy Rostislav Stanek

Published in: Central Eur. J. Oper. Res. (2017)

Keyphrases

subtour elimination
traveling salesman problem
lp relaxation
optimal solution
linear programming
combinatorial optimization
knapsack problem
integer programming
neural network
ant colony optimization
integer program
np hard
active contours
energy minimization
integer variables