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

DOI10.1016/j.disopt.2011.05.002zbMath1235.90124MaRDI QIDQ408370

J. Herrera, H. S. Yoon

Publication date: 5 April 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2011.05.002

zbMATH Keywords

approximation algorithm; traveling salesman problem; 2-matching

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization