scientific article; zbMATH DE number 7053369

zbMath1423.90236arXiv1107.1628MaRDI QIDQ5743492

Anke van Zuylen, David P. Williamson, Frans Schalekamp

Publication date: 10 May 2019

Full work available at URL: https://arxiv.org/abs/1107.1628

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (1)

TSP Tours in Cubic Graphs: Beyond 4/3

Cites Work

• Unnamed Item
• Unnamed Item
• Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
• Survivable networks, linear programming relaxations and the parsimonious property
• Analyzing the Held-Karp TSP bound: A monotonicity property with application
• Matchings in regular graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Worst-case comparison of valid inequalities for the TSP
• A new bound for the ratio between the 2-matching problem and its linear programming relaxation
• On the Integrality Gap of the Subtour LP for the 1,2-TSP
• TSP on Cubic and Subcubic Graphs
• Finding the Exact Integrality Gap for Small Traveling Salesman Problems
• Heuristic analysis, linear programming and branch and bound
• Integer Programming: Methods, Uses, Computations
• Solution of a Large-Scale Traveling-Salesman Problem
• A Randomized Rounding Approach to the Traveling Salesman Problem
• Approximating Graphic TSP by Matchings
• Maximum matching and a polyhedron with 0,1-vertices
• Optimum branchings

This page was built for publication: