Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices-Reference-Cited by-同舟云学术

Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices

Published:2011-11 Issue:4 Volume:8 Page:525-539
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Boyd Sylvia,Carr Robert

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference21 articles.

1. Computational complexity;Johnson,1985

2. N. Christofides, Worst case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration Carnegie Mellon University, Pittsburgh, 1976.

3. Minimum-weight two-connected spanning networks;Monma;Mathematical Programming,1990

4. Analyzing the Held–Karp TSP bound: a monotonicity property with application;Shmoys;Information Processing Letters,1990

5. Heuristic analysis, linear programming and branch and bound;Wolsey;Mathematical Programming Study,1980

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A (Slightly) Improved Approximation Algorithm for Metric TSP;Operations Research;2023-05-18

2. On the generation of metric TSP instances with a large integrality gap by branch-and-cut;Mathematical Programming Computation;2023-03-27

3. Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs;Discrete Optimization;2023-02

4. A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP;Integer Programming and Combinatorial Optimization;2023

5. Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours;Mathematical Programming;2022-03-21