Rudy’s OBTF
Rudolf Adamkovič
Home
/
Computer science
/
Traveling salesman problem (TSP)
Computation: Python, SAT, MTZ (with NN)
Imports
Input
Model
Decision variables
Auxiliary variables: Time of visitations
Hint: Nearest neighbor heuristic
Constraints: Arrivals
Constraints: Departures
Constraints: Sub-tour elimination (MTZ)
Constraints: Rotational symmetry
Objective function
Solution
© 2025
Rudolf Adamkovič
under
GNU General Public License
version 3.
Made with
Emacs
and secret alien technologies of yesteryear.