10.60507/FK2/JCUIRI Blauth, Jannis Jannis Blauth Research Inst. for Discrete Mathematics, Hausdorff Center for Math., University of Bonn, Germany Neuwohner, Meike Meike Neuwohner Research Inst. for Discrete Mathematics, Hausdorff Center for Math., University of Bonn, Germany Puhlmann, Luise Luise Puhlmann Research Inst. for Discrete Mathematics, Hausdorff Center for Math., University of Bonn, Germany Vygen, Jens Jens Vygen Research Inst. for Discrete Mathematics, Hausdorff Center for Math., University of Bonn, Germany bonndata 2023 Computer and Information Science Mathematical Sciences 2023-09-11 2023-09-20 2309.10663 10.60507/FK2/JCUIRI/NMHRM1 10.60507/FK2/JCUIRI/DDANO8 10.60507/FK2/JCUIRI/LHKW27 10.60507/FK2/JCUIRI/S9HTJO 10.60507/FK2/JCUIRI/AUWIXP 10.60507/FK2/JCUIRI/DFW5ZB 10.60507/FK2/JCUIRI/EGSFZH 239775 221683 10143 865208 50749132 16467 52050626 application/pdf application/pdf application/x-ipynb+json text/plain text/plain application/x-ipynb+json text/plain 1.0 Creative Commons CC0 1.0 Universal Public Domain Dedication. Dual 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). gurobi, 10.0.1 python, 3.11.4 jupyter-notebook, 6.5.4