The graphical traveling salesperson problem has no integer programming formulation in the original space

DOI10.1016/j.orl.2021.06.015OpenAlexW3173944492MaRDI QIDQ2060618

Matthias Walter

Publication date: 13 December 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.10097

zbMATH Keywords

integer programmingformulationgraphical traveling salesperson problem

Mathematics Subject Classification ID

Combinatorics (05-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Parity polytopes and binarization
• The traveling salesman problem on a graph and some related integer polyhedra
• A new integer programming formulation of the graphical traveling salesman problem

This page was built for publication: The graphical traveling salesperson problem has no integer programming formulation in the original space