scientific article; zbMATH DE number 1534298
From MaRDI portal
Publication:4517107
zbMath0957.90514MaRDI QIDQ4517107
Michel X. Goemans, Franz Rendl
Publication date: 23 November 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On conic QPCCs, conic QCQPs and completely positive programs, Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps, On approximating complex quadratic optimization problems via semidefinite programming relaxations, The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem, Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP, A guide to conic optimisation and its applications, Discrete optimization: an Austrian view, Semidefinite programming for discrete optimization and matrix completion problems, Exploiting semidefinite relaxations in constraint programming, New semidefinite programming relaxations for the linear ordering and the traveling salesman problem, A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem, Cuts for mixed 0-1 conic programming, Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
