An improved integrality gap for asymmetric TSP paths
Year of publication: |
August 2016
|
---|---|
Authors: | Friggstad, Zachary ; Gupta, Anupam ; Singh, Mohit |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 41.2016, 3, p. 745-757
|
Subject: | traveling salesman | linear programming | integrality gaps | thin spanning trees | Mathematische Optimierung | Mathematical programming | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Graphentheorie | Graph theory |
-
An LP-based 2/3-approximation algorithm for the s-t path graph traveling salesman problem
Gao, Zhihan, (2013)
-
Budgeted prize-collecting traveling salesman and minimum spanning tree problems
Paul, Alice, (2020)
-
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou, (2015)
- More ...
-
Scheduling problems over a network of machines
Friggstad, Zachary, (2019)
-
Assessment and selection of vendor in a manufacturing organisation : a graph theoretic approach
Singh, Mohit, (2013)
-
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
Nagarajan, Viswanath, (2010)
- More ...