A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem
2017
Discrete Applied Mathematics
In 2004 Newman [43] suggested a semidefinite programming relaxation for the Linear Ordering Problem (LOP) that is related to the semidefinite program used in the Goemans-Williamson algorithm to approximate the Max Cut problem [22] . Her model is based on the observation that linear orderings can be fully described by a series of cuts. Newman [43] shows that her relaxation seems better suited for designing polynomial-time approximation algorithms for the (LOP) than the widely-studied standard
doi:10.1016/j.dam.2016.07.013
fatcat:uq34rjzk7bfedmqkn4j2un7hca