Finding the Exact Integrality Gap for Small Traveling Salesman Problems
From MaRDI portal
Publication:3169005
DOI10.1287/moor.1080.0337zbMath1218.90167OpenAlexW2014294736MaRDI QIDQ3169005
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1d031e03daf6734ecd1179c40870826d6fcf3db9
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (12)
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices ⋮ Polyhedral techniques in combinatorial optimization: matchings and tours ⋮ Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs ⋮ On the generation of metric TSP instances with a large integrality gap by branch-and-cut ⋮ The traveling salesman problem on cubic and subcubic graphs ⋮ The salesman's improved tours for fundamental classes ⋮ On the Metric $s$--$t$ Path Traveling Salesman Problem ⋮ TSP on Cubic and Subcubic Graphs ⋮ On the core of traveling salesman games ⋮ On the Metric $s$--$t$ Path Traveling Salesman Problem ⋮ Unnamed Item ⋮ Approximating TSP walks in subcubic graphs
Uses Software
This page was built for publication: Finding the Exact Integrality Gap for Small Traveling Salesman Problems
