[AMPL 25008] Travelling Salesman Problem

Hello. Does anyone have the salesman’s problem written in ampl (considering n=10 and inventing some costs) with the following restrictions?

This is a version of the Miller-Tucker-Zemlin (MTZ) formulation of the TSP. You can find an AMPL model for a very similar version at https://ampl.com/wp-content/uploads/2021_08_Seoul_TD-09.1.pdf#page=7.

thank you!! you’ve helped me a lot!