On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach

Ejemplares similares

• The Integrality Gap of the Traveling Salesman Problem is $4/3$ if the LP Solution Has at Most $n+6$ Non-zero Components
  por: Villa, Tullio, et al.
  Publicado: (2025)
• Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
  por: Bernardelli, Ambrogio Maria, et al.
  Publicado: (2024)
• Asymptotic Bounds for the Traveling Salesman Problem with Drone
  por: Lee, Jae Hyeok, et al.
  Publicado: (2026)
• Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
  por: Encz, Koppány István, et al.
  Publicado: (2025)
• On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
  por: Au, Yu Hin, et al.
  Publicado: (2020)