Reference health

Algebraic optimization: The Fermat-Weber location problem

https://doi.org/10.1007/bf01585739
CiteStamped reference-health badge
9/9 checkable references clean · checked 2026-08-29

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.

8 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 9 checked references that resolve
resolves10.1016/0022-0000(86)90029-2
The complexity of elementary algebra and geometry
resolves10.1016/S0022-0000(73)80033-9
Time bounds for selection
resolves10.1145/800113.803626
Some NP-complete geometric problems
resolves10.1007/BF02579273
The ellipsoid method and its consequences in combinatorial optimization
resolves10.1145/800057.808681
Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers
resolves10.1109/SFCS.1985.4
Algebraic cell decomposition in NC
resolves10.1137/1.9781611970203
An Algorithmic Theory of Numbers, Graphs and Convexity
resolves10.1007/BF02591963
A quadratically convergent method for minimizing a sum of euclidean norms
resolves10.1525/9780520348097
A Decision Method for Elementary Algebra and Geometry
The 8 references without a DOI — listed, not checked
no DOI — not checkedC. Bajaj, “Geometric optimization and computational geometry,” Ph.D. Thesis, Computer Science Technical Report TR84-629, Cornell University (Ithaca, NY, 1984).
no DOI — not checkedG.E. Collins, “Quantifier elimination for real closed fields by cylindric algebraic decomposition,”Proceedings 2nd GI Conference on Automata Theory and Formal Languages, Lecture Notes in Computer Science, Vol. 35 (Springer-Verlag, Berlin, 1975) pp. 134–183.
no DOI — not checkedR.L. Graham, “Unsolved problem P73,”Problems and Solutions, Bulletin of the EATCS (1984) 205–206.
no DOI — not checkedG.H. Hardy, J.E. Littlewood, G. Polya,Inequalities (Cambridge University Press, London, 1943).
no DOI — not checkedH.W. Kuhn, “On a pair of dual nonlinear programs,” in: J. Abadie, ed.,Nonlinear Programming (North-Holland, Amsterdam, 1967) pp. 38–54.
no DOI — not checkedZ.A. Melzak,Companion to Concrete Mathematics (John Wiley & Sons, New York, 1973).
no DOI — not checkedJ.M. Ortega and W.C. Rheinboldt,Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, New York and London, 1970).
no DOI — not checkedA. Weber,Theory of the Location of Industries, translated by Carl J. Friedrich (The University of Chicago Press, Chicago, IL, 1937).
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-29 — 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/bf01585739"><img src="https://citestamp.com/citestamped/10.1007/bf01585739/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1007/bf01585739/badge.svg)](https://citestamp.com/citestamped/10.1007/bf01585739)