Reference health

On Semidefinite Programming Relaxations of the Traveling Salesman Problem

https://doi.org/10.2139/ssrn.1313648
CiteStamped reference-health badge
22/22 checkable references clean · checked 2026-08-31

Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.

6 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

The 22 checked references that resolve
resolves10.1145/290179.290180
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
resolves10.1080/10556789908805765
CSDP, A C library for semidefinite programming
resolves10.1016/0167-6377(91)90067-y
A complete description of the traveling salesman polytope on 8 nodes
resolves10.1007/bf02568602
Combinatorial optimization and small polytopes
resolves10.1007/3-540-48777-8_10
Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem
resolves10.1287/opre.2.4.393
Solution of a Large-Scale Traveling-Salesman Problem
resolves10.2139/ssrn.995407
Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem
resolves10.1016/j.jpaa.2003.12.011
Symmetry groups, semidefinite programs, and sums of squares
resolves10.1201/9781315137131
Algebraic Combinatorics
resolves10.1007/s006070050038
Semidefinite Programs and Association Schemes
resolves10.1007/978-1-4615-4381-7_12
Combinatorial Optimization
resolves10.1016/0024-3795(84)90207-6
Positive definite completions of partial Hermitian matrices
resolves10.1287/opre.18.6.1138
The Traveling-Salesman Problem and Minimum Spanning Trees
resolves10.1007/978-3-662-21711-5
Combinatorial Optimization
resolves10.1109/cacsd.2004.1393890
YALMIP : a toolbox for modeling and optimization in MATLAB
resolves10.1007/0-306-48213-4_2
Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP
resolves10.1145/335305.335320
On the approximability of the traveling salesman problem (extended abstract)
resolves10.1109/tit.1979.1056072
A comparison of the Delsarte and Lovász bounds
resolves10.1109/TIT.2005.851748
New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
resolves10.1016/0020-0190(90)90028-v
Analyzing the Held-Karp tsp bound: a monotonicity property with application
resolves10.1007/bfb0120913
Heuristic analysis, linear programming and branch and bound
resolves10.1023/A:1009795911987
Semidefinite Programming Relaxations for the Quadratic Assignment Problem
The 6 references without a DOI — listed, not checked
no DOI — not checkedWorst-case analysis of a new heuristic for the travelling salesman problem
no DOI — not checkedref13
no DOI — not checkedref19
no DOI — not checkedref20
no DOI — not checkedref24
no DOI — not checkedref26
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-08-31 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

view as graph · paper page

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.2139/ssrn.1313648"><img src="https://citestamp.com/citestamped/10.2139/ssrn.1313648/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.2139/ssrn.1313648/badge.svg)](https://citestamp.com/citestamped/10.2139/ssrn.1313648)