Rudy’s OBTF
Rudolf Adamkovič
Home
/
Computer science
/
Traveling salesman problem (TSP)
Computation: Python, SAT + NN, permutation
Imports
Input
Model
Decision variables
Auxiliary variables: Subscripts
Auxiliary variables: Terms
Hint
Constraints: Permutation
Constraints: Rotational symmetry
Objective
Solution
© 2025
Rudolf Adamkovič
under
GNU General Public License (GPL)
version 3 or later.
Made with
Emacs
and secret alien technologies of yesteryear.