Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP
From MaRDI portal
Publication:2183196
Recommendations
- scientific article; zbMATH DE number 1873286
- Constrained spanning trees and the traveling salesman problem
- Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- Generalized Subtour Elimination Constraints and Connectivity Constraints
Cites work
- scientific article; zbMATH DE number 1342125 (Why is no real title available?)
- scientific article; zbMATH DE number 1534298 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
- Solution of a Large-Scale Traveling-Salesman Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The unbounded integrality gap of a semidefinite relaxation of the traveling salesman problem
This page was built for publication: Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183196)