10.60507/FK2/JCUIRIBlauth, JannisJannisBlauthResearch Inst. for Discrete Mathematics, Hausdorff Center for Math., University of Bonn, GermanyNeuwohner, MeikeMeikeNeuwohnerResearch Inst. for Discrete Mathematics, Hausdorff Center for Math., University of Bonn, GermanyPuhlmann, LuiseLuisePuhlmannResearch Inst. for Discrete Mathematics, Hausdorff Center for Math., University of Bonn, GermanyVygen, JensJensVygenResearch Inst. for Discrete Mathematics, Hausdorff Center for Math., University of Bonn, Germanybonndata2023Computer and Information ScienceMathematical Sciences2023-09-112023-09-202309.1066323977522168386520850749132520506261014316467application/pdfapplication/pdftext/plaintext/plaintext/plainapplication/x-ipynb+jsonapplication/x-ipynb+json1.0CC0 1.0Dual 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.1python, 3.11.4jupyter-notebook, 6.5.4