Multi Integer Linear Programming and the Traveling Salesman Problem
2021 ◽
Vol 9
(VI)
◽
pp. 2417-2421
Keyword(s):
The Travelling Salesman problem is considered as a binary integer problem. For this problem, several stop variables and subtours are discussed. The stops are generated and the distance between those stops are found, consequently the graphs are drawn. Further the variables are declared and the constraints are framed. Then the initial problem is visualised along with the subtour constraints in order to achieve the required output.
2013 ◽
Vol 411-414
◽
pp. 2013-2016
◽
2020 ◽
Vol XLIV-4/W3-2020
◽
pp. 295-301
2018 ◽
Vol 12
(3)
◽
pp. 1054