The complexity of facets resolved
作者：
Highlights：
•
摘要
We show that recognizing the facets of the traveling salesman problem polytope is Dp-complete.
论文关键词：
论文评审过程：Received 25 March 1986, Revised 24 November 1987, Available online 2 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(88)90042-6
