Home / Computer science / Traveling salesman problem (TSP) / Computation: Python, SAT, MTZ
Constraints: Rotational symmetry breaking
Fix the first city to eliminate all rotations.
model.add(t[0] == 0)
N.B. There is also a reversal symmetry that is harder to define.