The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP
From MaRDI portal
Publication:6199246
DOI10.1287/MOOR.2022.1265arXiv2012.12363OpenAlexW3114183164MaRDI QIDQ6199246
Samuel C. Gutekunst, David P. Williamson
Publication date: 23 February 2024
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.12363
setscombinatoricsalgorithmsinteger programmingpolyhedratraveling salesmanmathematicscutting plane/facetnetworks/graphs
Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27) Eulerian and Hamiltonian graphs (05C45)
This page was built for publication: The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP