Okay, so I just finished my mathematical modelling of TSP using integer programming.
Now, how do I use it?
Now, I just want to know to use this model to solve a simple 5 vertices large graph.
You don't have to use any mathematical symbols, just answer in simple plain English.
This is what I suppose I have to do:
Go through all combinations, and for each combination check whether it violates any constraints, if it doesn't note down the value, if the value is less than the previous noted value, then this is our new lowest route value, else we simply move on, because the former route was less than our current one.