The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Reliable Facility Location Design Under the Risk of Disruptions
Open accessAbstract
Reliable facility location models consider unexpected failures with site-dependent probabilities, as well as possible customer reassignment. This paper proposes a compact mixed integer program (MIP) formulation and a continuum approximation (CA) model to study the reliable uncapacitated fixed charge location problem (RUFL), which seeks to minimize initial setup costs and expected transportation costs in normal and failure scenarios. The MIP determines the optimal facility locations as well as the optimal customer assignments and is solved using a custom-designed Lagrangian relaxation (LR) algorithm. The CA model predicts the total system cost without details about facility locations and customer assignments, and it provides a fast heuristic to find near-optimum solutions. Our computational results show that the LR algorithm is efficient for mid-sized RUFL problems and that the CA solutions are close to optimal in most of the test instances. For large-scale problems, the CA method is a good alternative to the LR algorithm that avoids prohibitively long running times.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Spatial Tessellations: Concepts and Applications of Voronoi Diagrams
Okabe, A., Boots, B. N., & Sugihara, K. (1992) · Cited by 3,546
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Fisher, M. L. (1981) · Management Science · doi:10.1287/mnsc.27.1.1 · Cited by 2,109
Theory of the Location of Industries
White, L., Weber, A., & Friedrich, C. J. (1931) · Economic Geography · doi:10.2307/140943 · Cited by 1,410
Network and Discrete Location: Models, Algorithms and Applications.
Salhi, S., & Daskin, M. S. (1997) · Journal of the Operational Research Society · doi:10.2307/3010074 · Cited by 1,220
Asymptotically optimal block quantization
Gersho, A. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056067 · Cited by 863
Dispatching Policies for a Transportation Route
Newell, G. F. (1971) · Transportation Science · doi:10.1287/trsc.5.1.91 · Cited by 253
A facility reliability problem: Formulation, properties, and algorithm
Lim, M., Daskin, M. S., Bassamboo, A., & Chopra, S. (2010) · Naval Research Logistics (NRL) · doi:10.1002/nav.20385 · Cited by 186
A supply chain design model with unreliable supply
Qi, L., & Shen, Z. M. (2007) · Naval Research Logistics (NRL) · doi:10.1002/nav.20255 · Cited by 100
Self-citation
Cited by
A critical review on supply chain risk – Definition, measure and modeling
Heckmann, I., Comes, T., & Nickel, S. (2015) · Omega · doi:10.1016/j.omega.2014.10.004 · Cited by 885
OR/MS models for supply chain disruptions: a review
Snyder, L. V., Atan, Z., Peng, P., Rong, Y., Schmitt, A. J., & Sinsoysal, B. (2016) · IIE Transactions · doi:10.1080/0740817x.2015.1067735 · Cited by 854
Supply chain network design under uncertainty: A comprehensive review and future research directions
Govindan, K., Fattahi, M., & Keyvanshokooh, E. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.04.009 · Cited by 705
Literature review on disruption recovery in the supply chain
Ivanov, D., Dolgui, A., Sokolov, B., & Ivanova, M. (2017) · International Journal of Production Research · doi:10.1080/00207543.2017.1330572 · Cited by 690
Reconfigurable supply chain: the X-network
Dolgui, A., Ivanov, D., & Sokolov, B. (2020) · International Journal of Production Research · doi:10.1080/00207543.2020.1774679 · Cited by 501
Metadata
- Authors
- Cui, T., Ouyang, Y., & Shen, Z.-J. M.
- Venue
- Operations Research
- Published
- 2010-08
- Volume
- 58
- Issue
- 4-part-1
- Pages
- 998-1011
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2127685347
- Cited by
- 449
- References
- 9
- FWCI
- 44.09
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Reliable Facility Location Design Under the Risk of Disruptions. https://app.cochat.ai/papers/10.1287/opre.1090.0801
- The paper
- Cui, T., Ouyang, Y., & Shen, Z.-J. M. (2010). Reliable Facility Location Design Under the Risk of Disruptions. Operations Research. https://doi.org/10.1287/opre.1090.0801
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.