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

Discrete Applied Mathematics - Tập 217 - Trang 19-39 - 2017
Philipp Hungerländer1
1Department of Mathematics, Alpen-Adria Universität Klagenfurt, Austria

Tài liệu tham khảo