Constarium
← Search

Data · dataset · 2023

Replication Data for: Improved guarantees for the a priori TSP

Listed in bonndata

Dual linear programming solutions and Python scripts that verify their feasibility.

Description

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" (arxiv.org/abs/2309.10663).

Links

Where it is published

Catalogue records · 1

Topics

Provenance · 1 source records, 9 field assertions
SourceKeyLast seenRaw
bonndatadoi:10.60507/FK2/JCUIRI11 d agoJSON v1
FieldAssertionExtractorEvidence
concepts[field].dataverse_subject:computer-and-information-sciencesource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0/subjects
concepts[field].dataverse_subject:mathematical-sciencessource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0/subjects
concepts[field].local:field:mathematics-statisticsmapping · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0/subjects
created_datesource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0
descriptionsource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0/description
publication_datesource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0
titlesource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0/name
updated_datesource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0
version_labelsource · bonndata uni bonn deconnector:bonndata_uni_bonn_de@1.0.0