Reference health

A note on the prize collecting traveling salesman problem

https://doi.org/10.1007/bf01581256
CiteStamped reference-health badge
4/4 checkable references clean · checked 2026-09-02

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 4 checked references that resolve
resolves10.1002/net.3230190602
The prize collecting traveling salesman problem
resolves10.1287/opre.18.6.1138
The Traveling-Salesman Problem and Minimum Spanning Trees
resolves10.1007/BF01902503
On some connectivity properties of Eulerian graphs
resolves10.1007/BFb0120913
Heuristic analysis, linear programming and branch and bound
The 6 references without a DOI — listed, not checked
no DOI — not checkedN. Christofides, “Worst-case analysis of a new heuristic for the traveling salesman problem,” Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University (Pittsburgh, PA, 1976).
no DOI — not checkedM.X. Goemans and D.J. Bertsimas, “On the parsimonious property of connectivity problems,” in:Proceeding of the 1st ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1990).
no DOI — not checkedD.S. Johnson and C.H. Papadimitriou, “Performance guarantees for heuristics,” in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985) pp. 145–180.
no DOI — not checkedJ.K. Lenstra, D.B. Shmoys and E. Tardos, “Approximation algorithms for scheduling unrelated parallel machines,” in:Proceedings of the 28th Annual IEEE Symposium on the Foundation of Computer Science (Computer Society Press of the IEEE, New York, 1987) pp. 217–224.
no DOI — not checkedL. Lovasz,Combinatorial Problems and Exercises (North-Holland, Amsterdam, 1979).
no DOI — not checkedD. Shmoys and D. Williamson, “Analyzing the Held—Karp TSP bound: A monotonicity property with application,” to appear in:Information Processing Letters (1988).
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-09-02 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

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.1007/bf01581256"><img src="https://citestamp.com/citestamped/10.1007/bf01581256/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1007/bf01581256/badge.svg)](https://citestamp.com/citestamped/10.1007/bf01581256)