Replication Data for: Improved guarantees for the a priori TSPhttps://doi.org/10.60507/FK2/JCUIRIBlauth, JannisNeuwohner, MeikePuhlmann, LuiseVygen, Jensbonndata2023-09-202023-09-20T09:51:57ZDual linear programming solutions and Python scripts that verify their feasibility. The dual linear programs for which feasible solutions are provided can be found in the provided README files. The linear programming solutions yield upper bounds on the approximability of the a priori traveling salesperson problem. For further details, see the paper "Improved guarantees for the a priori TSP" (https://arxiv.org/abs/2309.10663).Computer and Information ScienceMathematical SciencesarXiv, 2309.10663, https://arxiv.org/abs/2309.106632023-09-20Blauth, Jannis2023-09-11CC0 1.0