Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Bookmarks inbookmarks:mine
inbookmarks:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options answers only user 199

For questions related to the traveling salesman problem (TSP), which seeks, for a given set of nodes, the shortest path that visits every node and returns to the starting node.

5
votes
Would you see, Multiple Traveling Salesman Problem (mTSP). I think with add some limitation (as your constraints), it might be useful.
answered Aug 29 '19 by A.Omidi
1
vote
If you are interested to develop an optimization model (specifically MIP), based on your specific problem and also you would like to solve your problem using the commercial solvers to obtain the optim …
answered Dec 9 '19 by A.Omidi
2
votes
I am pretty sure, this is not the best way to tackle such a problem, specifically from the computational complexity point of view, but at least it might be represented as an effort to solve small-scal …
answered Dec 25 '21 by A.Omidi
1
vote
I would like to add an answer by @Misha Lavrov: The MTZ constraints really need to know the direction of an edge in order to work. I have called them "timing constraints" when teaching, because they a …
answered Nov 2 '21 by A.Omidi