Reference health

Plant location with minimum inventory

https://doi.org/10.1007/bf02680552
CiteStamped reference-health badge
15/15 checkable references clean · checked 2026-09-04

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.

11 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 15 checked references that resolve
resolves10.1287/opre.46.3.316
Branch-and-Price: Column Generation for Solving Huge Integer Programs
resolves10.1007/3-540-59408-6_49
On implementing push-relabel method for the maximum flow problem
resolves10.1287/moor.8.4.579
On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
resolves10.1287/moor.8.4.590
On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
resolves10.1287/mnsc.23.8.789
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
resolves10.1137/0603051
A Primal Approach to the Simple Plant Location Problem
resolves10.1287/opre.8.1.101
Decomposition Principle for Linear Programs
resolves10.1287/opre.26.6.992
A Dual-Based Procedure for Uncapacitated Facility Location
resolves10.4153/CJM-1956-045-5
Maximal Flow Through a Network
resolves10.1287/trsc.8.3.217
An Algorithm for the M-Median Plant Location Problem
resolves10.1007/BFb0120690
Lagrangean relaxation for integer programming
resolves10.1007/BFb0120893
Fractional vertices, cuts and facets of the simple plant location problem
resolves10.1287/opre.18.6.1138
The Traveling-Salesman Problem and Minimum Spanning Trees
resolves10.1007/BF01584070
The traveling-salesman problem and minimum spanning trees: Part II
resolves10.1007/BF01580223
Validation of subgradient optimization
The 11 references without a DOI — listed, not checked
no DOI — not checkedR.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1990.
no DOI — not checkedR. Anbil, Personal communication, 1995.
no DOI — not checkedM.L. Balinski, On finding integer solutions to linear programs, Mathematica, Princeton, NJ, 1964.
no DOI — not checkedV. Chvátal, Linear Programming, Freeman, New York, 1993.
no DOI — not checkedG. Cornuejols, G.L. Nemhauser, L.A. Wolsey, The uncapacitated facility location problem, in: P.B. Mirchandani, R.L. Francis (Eds.), Discrete Location Theory, Wiley, New York, 1990.
no DOI — not checkedIBM Corp., Optimization Subroutine Library: Guide and Reference, 1995.
no DOI — not checkedM. Guignard, S. Zhu, A two-phase dual algorithm for solving lagrangean duals, Technical Report, The Wharton school, University of Pennsylvania, 1995.
no DOI — not checkedM. Jünger, S. Thienel, Introduction to ABACUS—a branch-and-cut system, Technical Report 97.263, Universität zu Köln, 1997.
no DOI — not checkedP.B. Mirchandani, R.L. Francis, Discrete Location Theory, Wiley, New York, 1990.
no DOI — not checkedB.T. Polyak, Minimization of unsmooth functionals, U.S.S.R. Comput. Math. and Math. Phys. 9 (1969) 509–521.
no DOI — not checkedM.W.P. Savelsbergh, G.L. Nemhauser, Functional description of MINTO, a mixed integer optimizer, Technical Report, Georgia Institute of Technology, School of Industrial and Systems Engineering, 1993.
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-04 — 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/bf02680552"><img src="https://citestamp.com/citestamped/10.1007/bf02680552/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1007/bf02680552/badge.svg)](https://citestamp.com/citestamped/10.1007/bf02680552)