New answers tagged traveling-salesman
0
votes
Subtour elimination constraint in Travelling Salesman Problem
A good visualization is in the video https://youtu.be/SzORM1aSwQY
0
votes
Interpretation of a subtour elimination constraint in the TSP
A good visualization is in the video https://youtu.be/SzORM1aSwQY
4
votes
Accepted
Subtour elimination in SDVRP
The subtour elimination constraints are not correct, they are mostly empty. Try to debug the callback calls, as you can see also from the log, none of lazy constraints are applied.
You can:
use ...
- 172
3
votes
Subtour elimination in SDVRP
Your implementations of constraints (1), (6) and (7) do not match the algebraic formulation. (You sum over different variables than what the formulation indicates.) Does fixing that solve the problem?
...
- 31.1k
2
votes
Best exact method to solve TSP
I would say "it depends". If the instances you want to solve are small (up to, say, 10-12 nodes) then dynamic programming works wonders. If the problem is up to 30-40 nodes, you can get by ...
- 5,445
1
vote
Best exact method to solve TSP
For small instances, i think the branch and cut will works well. You can try localsolver or concorde to prove optimality for bigger instances in reasonable time.
- 385
Top 50 recent answers are included