The Circlet Inequalities: A New, Circulant-Based Facet-Defining Inequality for the TSP

arxiv(2020)

引用 1|浏览2
暂无评分
摘要
Facet-defining inequalities of the symmetric Traveling Salesman Problem (TSP) polytope play a prominent role in both polyhedral TSP research and state-of-the-art TSP solvers. In this paper, we introduce a new class of facet-defining inequalities, the \emph{circlet inequalities}. These inequalities were first conjectured in Gutekunst and Williamson \cite{Gut19b} when studying Circulant TSP, and they provide a bridge between polyhedral TSP research and number-theoretic investigations of Hamiltonian cycles stemming from a conjecture due to Marco Buratti in 2017. The circlet inequalities exhibit circulant symmetry by placing the same weight on all edges of a given length; our main proof exploits this symmetry to prove the validity of the circlet inequalities. We then show that the circlet inequalities are facet-defining and compute their strength following Goemans \cite{Goe95b}; they achieve the same worst-case strength as the similarly circulant crown inequalities of Naddef and Rinaldi \cite{Nad92}, but are generally stronger.
更多
查看译文
关键词
mathematics, combinatorics, sets, polyhedra, networks, graphs, traveling salesman, integer programming, algorithms, cutting plane/facet
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要