Replication Data for: Improved guarantees for the a priori TSP
收藏bonndata2023-09-20 更新2026-05-11 收录
下载链接：
https://bonndata.uni-bonn.de/citation?persistentId=doi:10.60507/FK2/JCUIRI
下载链接
链接失效反馈官方服务：
资源简介：
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).
提供机构：
Research Inst. for Discrete Mathematics, Hausdorff Center for Math., University of Bonn, Germany
创建时间：
2023-01-01
