Furthermore, a general procedure for the extension of vertices from \(P^n_{ASEP}\) to \(P^{n + 1}_{ASEP}\) is defined. The generated vertices improve the known lower bounds of the integrality gap for \( 16 \leq n \leq 22\) and provide small hard-to-solve ATSP instances.
On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
\(\)In this paper, we investigate the integrality gap of the Asymmetric Traveling Salesman Problem (ATSP) with respect to the linear relaxation given by the Asymmetric Subtour Elimination Problem (ASEP) for instances with \(n\) nodes, where \(n\) is small. In particular, we focus on the geometric properties and symmetries of the ASEP polytope \(P^n_{ASEP}\) and its vertices. The polytope’s symmetries are exploited to design a heuristic pivoting algorithm to search for vertices where the integrality gap is maximized.
Furthermore, a general procedure for the extension of vertices from \(P^n_{ASEP}\) to \(P^{n + 1}_{ASEP}\) is defined. The generated vertices improve the known lower bounds of the integrality gap for \( 16 \leq n \leq 22\) and provide small hard-to-solve ATSP instances.
Furthermore, a general procedure for the extension of vertices from \(P^n_{ASEP}\) to \(P^{n + 1}_{ASEP}\) is defined. The generated vertices improve the known lower bounds of the integrality gap for \( 16 \leq n \leq 22\) and provide small hard-to-solve ATSP instances.