| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949855 | Discrete Applied Mathematics | 2017 | 21 Pages |
Abstract
In this paper we strengthen the relaxation proposed by Newman (2004) [43] and conduct a polyhedral study of the corresponding polytope. Furthermore we relate the relaxation to other linear and semidefinite relaxations for the (LOP) and for the Traveling Salesman Problem and elaborate on its connection to the Max Cut problem.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Philipp Hungerländer,