Solving the Traveling Salesman Problem via Subtour Elimination Constraints predictions
I am investigating algorithms with predictions for the Traveling Salesman Problem, where a predictor identifies a small (=constant size) set of subtour elimination constraints rather than directly predicting the optimal tour. The goal is to exploit these predictions to efficiently construct and repair low-cost 2-factors, providing provable guarantees that degrade gracefully with prediction error.