Optimizing Moving-Target Traveling Salesman Problem with Convex Sets

The author introduces a new formulation for the Moving-Target Traveling Salesman Problem (MT-TSP) based on convex sets, outperforming the current state-of-the-art Mixed Integer Conic Program (MICP) solver.