Reference14 articles.
1. M. M. Deza and M. Laurent, Geometry of Cuts and Metrics (Springer-Verlag, Berlin, 1997; MTsNMO, Moscow, 2001).
2. A. Nonnengart and C. Weidenbach, “Computing Small Clause Normal Forms,” in Handbook of Automated Reasoning, Ed. by A. Robinson and A. Voronkov (Elsevier Science and MIT Press, 2001), pp. 335–367.
3. L. J. Billera and A. Sarangarajan, “All 0-1 Polytopes Are Travelling Salesman Polytopes,” Combinatorica 16, 175–188 (1996).
4. A. N. Maksimenko, “Polytopes of the Satisfiability Problem Are Facets of the Polytope of the Travelling Salesman Problem,” Diskretn. Analiz i Issledov. Operatsii 18(3), 76–83 (2011).
5. R. M. Karp, “Reducibility Among Combinatorial Problems,” in Complexity of Computer Computations, Ed. by R. E. Miller and J.W. Thatcher (Plenum Press, 1972), pp. 85–103.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献