The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Facility location models for distribution system design
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
Hotelling, H. (1929) · The Economic Journal · doi:10.2307/2224214 · Cited by 6,861
Hotelling, H. (1990) · The Collected Economics Articles of Harold Hotelling · doi:10.1007/978-1-4613-8905-7_4 · Cited by 5,677
Knapsack Problems: Algorithms and Computer Implementations
Connolly, D., Martello, S., & Toth, P. (1991) · Journal of the Operational Research Society · doi:10.2307/2583458 · Cited by 3,120
Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
Hakimi, S. L. (1964) · Operations Research · doi:10.1287/opre.12.3.450 · Cited by 2,474
(2003) · Selected Papers of Alan J Hoffman · doi:10.1142/9789812796936_others05 · Cited by 2,465
Handbooks in operations research and management science
Nemhauser, G. L., & Kan, A. H. G. R. (1989) · Elsevier eBooks · Cited by 2,436
Lectu re Notes in Economics and Mathematical Systems
Beckmann, M. J., & Künzi, H. P. (1975) · Cited by 2,414
Strategic facility location: A review
Owen, S. H., & Daskin, M. S. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00186-6 · Cited by 1,380
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,227
Facility Layout and Location: An Analytical Approach
Francis, R. L., McGinnis, L. F., & White, J. A. (1991) · Medical Entomology and Zoology · Cited by 1,088
A generalized assignment heuristic for vehicle routing
Fisher, M. L., & Jaikumar, R. (1981) · Networks · doi:10.1002/net.3230110205 · Cited by 1,076
Multicommodity Distribution System Design by Benders Decomposition * † ‡
Geoffrion, A. M., & Graves§, G. W. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-6810-4_4 · Cited by 978
A quadratic integer program for the location of interacting hub facilities
O'kelly, M. E. (1987) · European Journal of Operational Research · doi:10.1016/s0377-2217(87)80007-3 · Cited by 955
Integer programming formulations of discrete hub location problems
Campbell, J. F. (1994) · European Journal of Operational Research · doi:10.1016/0377-2217(94)90318-2 · Cited by 916
A Dual-Based Procedure for Uncapacitated Facility Location
Erlenkotter, D. (1978) · Operations Research · doi:10.1287/opre.26.6.992 · Cited by 912
Multicommodity Distribution System Design by Benders Decomposition
Geoffrion, A. M., & Graves, G. W. (1974) · Management Science · doi:10.1287/mnsc.20.5.822 · Cited by 906
Cornuejols, G., Fisher, M. L., & Nemhauser, G. L. (1977) · Management Science · doi:10.1287/mnsc.23.8.789 · Cited by 793
Vidal, C. J., & Goetschalckx, M. (1997) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)80080-x · Cited by 759
On “a quadratic integer program for the location of interacting hub facilities”
Aykin, T. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90018-7 · Cited by 715
The Location of Interacting Hub Facilities
O'Kelly, M. E. (1986) · Transportation Science · doi:10.1287/trsc.20.2.92 · Cited by 631
Another proof of the defect relation for moving targets
Shirosaki, M. (1991) · Tohoku Mathematical Journal · doi:10.2748/tmj/1178227459 · Cited by 614
Padberg, M. (1980) · Mathematical programming studies · doi:10.1007/bfb0120883 · Cited by 577
Coordination of production and distribution planning
Chandra, P., & Fisher, M. L. (1994) · European Journal of Operational Research · doi:10.1016/0377-2217(94)90419-7 · Cited by 559
The simple plant location problem: Survey and synthesis
Krarup, J., & Pruzan, P. M. (1983) · European Journal of Operational Research · doi:10.1016/0377-2217(83)90181-9 · Cited by 544
Integrated production/distribution planning in supply chains: An invited review
Erengüç, Ş. S., Simpson, N., & Vakharia, A. J. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)90299-5 · Cited by 531
Greedy strikes back: Improved Facility Location Algorithms
Guha, S., & Khuller, S. (1998) · Cited by 515
Fleet Management and Logistics
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5755-5 · Cited by 485
Goetschalckx, M., Vidal, C. J., & Dogan, K. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00142-x · Cited by 482
Balas, E., & Padberg, M. W. (1976) · SIAM Review · doi:10.1137/1018115 · Cited by 449
A two-level network for recycling sand: A case study
Barros, A. I., Dekker, R., & Scholten, V. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00093-9 · Cited by 447
Cornuéjols, G., Fisher, M. L., & Nemhauser, G. L. (1979) · Management Science · doi:10.1287/mnsc.25.8.808 · Cited by 430
Competitive Location Models: A Framework and Bibliography
Eiselt, H. A., Gilbert Laporte, A., & Thisse, J. (1993) · Transportation Science · doi:10.1287/trsc.27.1.44 · Cited by 372
du Merle, O., Villeneuve, D. L., Desrosiers, J., & Hansen, P. (1999) · Discrete Mathematics · doi:10.1016/s0012-365x(98)00213-1 · Cited by 351
Approximation schemes for Euclidean k-medians and related problems
Arora, S., Raghavan, P., & Rao, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276718 · Cited by 341
Multiobjective analysis of facility location decisions
Current, J. R., Min, H., & Schilling, D. A. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90401-v · Cited by 307
A warehouse location-routing problem
Perl, J., & Daskin, M. S. (1985) · Transportation Research Part B Methodological · doi:10.1016/0191-2615(85)90052-9 · Cited by 289
A comparison of heuristics and relaxations for the capacitated plant location problem
Cornuejols, G., Sridharan, R., & Thizy, J. M. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90261-s · Cited by 285
A Location Based Heuristic for General Routing Problems
Bramel, J., & Simchi‐Levi, D. (1995) · Operations Research · doi:10.1287/opre.43.4.649 · Cited by 280
Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem
Brimberg, J., Hansen, P., Mladenović, N., & Taillard, É. D. (2000) · Operations Research · doi:10.1287/opre.48.3.444.12431 · Cited by 269
Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
Aykin, T. (1995) · Transportation Science · doi:10.1287/trsc.29.3.201 · Cited by 229
On the exact solution of large-scale simple plant location problems
Körkel, M. (1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90189-6 · Cited by 168
A heuristic lagrangean algorithm for the capacitated plant location problem
Barceló, J., & Casanovas, J. (1984) · European Journal of Operational Research · doi:10.1016/0377-2217(84)90211-x · Cited by 140
Database Location in Computer Networks
Fisher, M. L., & Hochbaum, D. S. (1980) · Journal of the ACM · doi:10.1145/322217.322226 · Cited by 130
Delmaire, H., Díaz, J. A., Fernández, E., & Ortega, M. (1999) · INFOR Information Systems and Operational Research · doi:10.1080/03155986.1999.11732381 · Cited by 113
A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
Simchi‐Levi, D., & Berman, O. (1988) · Operations Research · doi:10.1287/opre.36.3.478 · Cited by 103
Some facets of the simple plant location polytope
Cornuéjols, G., & Thizy, J. (1982) · Mathematical Programming · doi:10.1007/bf01583779 · Cited by 85
New Trends in Distribution Logistics
Stähly, P., & Speranza, M. G. (1999) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-58568-5 · Cited by 73
Exact and approximate algorithms for the index selection problem in physical database design
Caprara, A., Fischetti, M., & Maio, D. (1995) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.476501 · Cited by 64
Separating lifted odd-hole inequalities to solve the index selection problem
Caprara, A., & Salazar‐González, J. (1999) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(99)00050-5 · Cited by 18
Cited by
Facility location and supply chain management – A review
Melo, M. T., Nickel, S., & Saldanha-da-Gama, F. (2009) · European Journal of Operational Research · doi:10.1016/j.ejor.2008.05.007 · Cited by 1,934
Facility location in humanitarian relief
Balcik, B., & Beamon, B. M. (2008) · International Journal of Logistics Research and Applications · doi:10.1080/13675560701561789 · Cited by 1,090
The design of robust value-creating supply chain networks: A critical review
Klibi, W., Martel, A., & Guitouni, A. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.06.011 · Cited by 870
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
Multiple criteria facility location problems: A survey
Farahani, R. Z., SteadieSeifi, M., & Asgari, N. (2010) · Applied Mathematical Modelling · doi:10.1016/j.apm.2009.10.005 · Cited by 661
Metadata
- Authors
- Klose, A., & Drexl, A.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2005-04
- Volume
- 162
- Issue
- 1
- Pages
- 4-29
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2078286011
- Cited by
- 965
- References
- 49
- FWCI
- 36.58
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.