Treffer: New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem

Title:
New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem
Source:
In Discrete Applied Mathematics 30 January 2017 217 Part 1:19-39
Database:
ScienceDirect