{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T20:39:47Z","timestamp":1774643987406,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,3,27]],"date-time":"2015-03-27T00:00:00Z","timestamp":1427414400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10898-015-0293-4","type":"journal-article","created":{"date-parts":[[2015,3,27]],"date-time":"2015-03-27T01:48:08Z","timestamp":1427420888000},"page":"381-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Confidence in heuristic solutions?"],"prefix":"10.1007","volume":"63","author":[{"given":"Kenneth","family":"Carling","sequence":"first","affiliation":[]},{"given":"Xiangli","family":"Meng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,27]]},"reference":[{"issue":"2","key":"293_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.cor.2011.03.015","volume":"39","author":"MH Aky\u00fcz","year":"2012","unstructured":"Aky\u00fcz, M.H., \u00d6ncan, T., Alt\u0131nel, I.K.: Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem. Comput. Oper. Res. 39(2), 225\u2013237 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"28","key":"293_CR2","first-page":"1357","volume":"3","author":"A Al-Khedhairi","year":"2008","unstructured":"Al-Khedhairi, A.: Simulated annealing metaheuristic for solving p-median problem. Int. J. Contemp. Math. Sci. 3(28), 1357\u20131365 (2008)","journal-title":"Int. J. Contemp. Math. Sci."},{"issue":"11","key":"293_CR3","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1067\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"293_CR4","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","volume":"65","author":"JE Beasley","year":"1993","unstructured":"Beasley, J.E.: Lagrangian heuristics for location problems. Eur. J. Oper. Res. 65, 383\u2013399 (1993)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"293_CR5","first-page":"289","volume":"1","author":"ML Brandeau","year":"1993","unstructured":"Brandeau, M.L., Chiu, S.S.: Sequential location and allocation: worst case performance and statistical estimation. Locat. Sci. 1(4), 289\u2013298 (1993)","journal-title":"Locat. Sci."},{"issue":"1","key":"293_CR6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10479-012-1214-2","volume":"201","author":"K Carling","year":"2012","unstructured":"Carling, K., Han, M., H\u00e5kansson, J.: Does Euclidean distance work well when the $$p$$ p -median model is applied in rural areas? Ann. Oper. Res. 201(1), 83\u201397 (2012)","journal-title":"Ann. Oper. Res."},{"key":"293_CR7","doi-asserted-by":"crossref","unstructured":"Carling, K., Meng, X.: On statistical bounds of heuristic solutions to location problems. J. Comb. Optim. (2015). doi: 10.1007\/s10878-015-9839-0","DOI":"10.1007\/s10878-015-9839-0"},{"key":"293_CR8","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1080\/01621459.1979.10481038","volume":"74","author":"WS Cleveland","year":"1979","unstructured":"Cleveland, W.S.: Robust locally weighted regression and smoothing scatterplots. J. Am. Stat. Assoc. 74, 829\u2013836 (1979)","journal-title":"J. Am. Stat. Assoc."},{"issue":"12","key":"293_CR9","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1287\/mnsc.23.12.1273","volume":"23","author":"DG Dannenbring","year":"1977","unstructured":"Dannenbring, D.G.: Procedures for estimating optimal solution values for large combinatorial problems. Manag. Sci. 23(12), 1273\u20131283 (1977)","journal-title":"Manag. Sci."},{"key":"293_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032343","volume-title":"Network and Discrete Location: Models, Algorithms, and Applications","author":"MS Daskin","year":"1995","unstructured":"Daskin, M.S.: Network and Discrete Location: Models, Algorithms, and Applications. Wiley, New York (1995)"},{"key":"293_CR11","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF01434270","volume":"71","author":"PJ Densham","year":"1992","unstructured":"Densham, P.J., Rushton, G.: A more efficient heuristic for solving large $$p$$ p -median problems. Pap. Reg. Sci. 71, 307\u2013329 (1992)","journal-title":"Pap. Reg. Sci."},{"issue":"5","key":"293_CR12","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1287\/opre.33.5.1024","volume":"33","author":"U Derigs","year":"1985","unstructured":"Derigs, U.: Using confidence limits for the global optimum in combinatorial optimization. Oper. Res. 33(5), 1024\u20131049 (1985)","journal-title":"Oper. Res."},{"issue":"1","key":"293_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aos\/1176344552","volume":"7","author":"B Efron","year":"1979","unstructured":"Efron, B.: Bootstrap methods: another look at the Jackknife. Ann. Stat. 7(1), 1\u201326 (1979)","journal-title":"Ann. Stat."},{"key":"293_CR14","volume-title":"Computers and Intractability, 29","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, 29. Freeman, New York (2002)"},{"key":"293_CR15","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10732-014-9243-4","volume":"20","author":"AP Giddings","year":"2014","unstructured":"Giddings, A.P., Rardin, R.L., Uzsoy, R.: Statistical optimum estimation techniques for combinatorial problems: a review and critique. J. Heuristics 20, 329\u2013358 (2014)","journal-title":"J. Heuristics"},{"issue":"1","key":"293_CR16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/nav.3800260108","volume":"26","author":"BL Golden","year":"1979","unstructured":"Golden, B.L., Alt, F.B.: Interval estimation of a global optimum for large combinatorial optimization. Nav. Res. Logist. 26(1), 69\u201377 (1979)","journal-title":"Nav. Res. Logist."},{"issue":"1","key":"293_CR17","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0377-2217(87)90142-1","volume":"31","author":"DJ Gonsalvez","year":"1987","unstructured":"Gonsalvez, D.J., Hall, N.G., Rhee, W.T., Siferd, S.P.: Heuristic solutions and confidence intervals for the multicovering problem. Eur. J. Oper. Res. 31(1), 94\u2013101 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"293_CR18","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3), 450\u2013459 (1964)","journal-title":"Oper. Res."},{"issue":"3","key":"293_CR19","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","volume":"13","author":"SL Hakimi","year":"1965","unstructured":"Hakimi, S.L.: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. 13(3), 462\u2013475 (1965)","journal-title":"Oper. Res."},{"key":"293_CR20","unstructured":"Han, M.: Heuristic optimization of the p-median problem and population re-distribution. Dalarna Doctoral Dissertations, 1(2013)"},{"key":"293_CR21","unstructured":"Han, M., H\u00e5kansson, J., Rebreyend, P. How do different densities in a network affect the optimal location of service centers?. Working papers in transport, tourism, information technology and microdata analysis, 2013:15"},{"key":"293_CR22","volume-title":"Location on Networks: Theorem and Algorithms","author":"GY Handler","year":"1979","unstructured":"Handler, G.Y., Mirchandani, P.B.: Location on Networks: Theorem and Algorithms. MIT Press, Cambridge (1979)"},{"key":"293_CR23","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. part 2: The p-median. SIAM J. Appl. Math. 37, 539\u2013560 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"293_CR24","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1023\/B:AURC.0000019375.23201.c1","volume":"65","author":"T Levanova","year":"2004","unstructured":"Levanova, T., Loresh, M.A.: Algorithm of ant system and simulated annealing for the p-median problem. Autom. Remote Control 65, 431\u2013438 (2004)","journal-title":"Autom. Remote Control"},{"key":"293_CR25","doi-asserted-by":"crossref","first-page":"2007","DOI":"10.1016\/j.cor.2008.06.012","volume":"36","author":"M Luis","year":"2009","unstructured":"Luis, M., Sahli, S., Nagy, G.: Region-rejection based heuristics for the capacitated multi-source Weber problem. Comput. Oper. Res. 36, 2007\u20132017 (2009)","journal-title":"Comput. Oper. Res."},{"key":"293_CR26","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1287\/opre.19.6.1331","volume":"19","author":"KL McRobert","year":"1971","unstructured":"McRobert, K.L.: A search model for evaluating combinatorially explosive problems. Oper. Res. 19, 1331\u20131349 (1971)","journal-title":"Oper. Res."},{"key":"293_CR27","doi-asserted-by":"crossref","unstructured":"Meng, X., Carling, K., (2014). How to decide upon stopping aheuristic algorithm in facility-location problems?. In WebInformation Systems Engineering\u2014WISE 2013 Workshops, Lecture Notesin Computer Science, 8182, 280\u2013283, Springer, Berlin\/Heidelberg","DOI":"10.1007\/978-3-642-54370-8_23"},{"key":"293_CR28","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01889983","volume":"1","author":"Z Michalewicz","year":"1991","unstructured":"Michalewicz, Z., Janikow, C.Z.: Genetic algorithms for numerical optimization. Stat. Comput. 1, 75\u201391 (1991)","journal-title":"Stat. Comput."},{"key":"293_CR29","first-page":"139","volume":"4","author":"HM Monroe","year":"1984","unstructured":"Monroe, H.M., Sielken, R.L.: Confidence limits for global optima based on heuristic solutions to difficult optimization problems: a simulation study. Am. J. Math. Manag. Sci. 4, 139\u2013167 (1984)","journal-title":"Am. J. Math. Manag. Sci."},{"key":"293_CR30","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/0305-0548(88)90059-7","volume":"5","author":"RL Nydick","year":"1988","unstructured":"Nydick, R.L., Weiss, H.J.: A computational evaluation of optimal solution value estimation procedures. Comput. Oper. Res. 5, 427\u2013440 (1988)","journal-title":"Comput. Oper. Res."},{"key":"293_CR31","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1093\/biomet\/43.3-4.353","volume":"43","author":"MH Quenouille","year":"1956","unstructured":"Quenouille, M.H.: Notes on bias in estimation. Biometrika 43, 353\u2013360 (1956)","journal-title":"Biometrika"},{"issue":"3","key":"293_CR32","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20128","volume":"48","author":"J Reese","year":"2006","unstructured":"Reese, J.: Solution methods for the $$p$$ p -median problem: an annotated bibliography. Networks 48(3), 125\u2013142 (2006)","journal-title":"Networks"},{"key":"293_CR33","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1093\/biomet\/51.1-2.33","volume":"51","author":"DS Robson","year":"1964","unstructured":"Robson, D.S., Whitlock, J.H.: Estimation of a truncation point. Biometrika 51, 33\u201339 (1964)","journal-title":"Biometrika"},{"issue":"2","key":"293_CR34","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"ED Taillard","year":"1995","unstructured":"Taillard, E.D.: Comparison of iterative searches for the quadratic assignment problem. Locat. Sci. 3(2), 87\u2013105 (1995)","journal-title":"Locat. Sci."},{"key":"293_CR35","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1080\/01621459.1980.10477521","volume":"75","author":"PF Velleman","year":"1980","unstructured":"Velleman, P.F.: Definition and comparison of robust nonlinear data smoothing algorithms. J. Am. Stat. Assoc. 75, 609\u2013615 (1980)","journal-title":"J. Am. Stat. Assoc."},{"key":"293_CR36","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/S0377-2217(02)00910-4","volume":"155","author":"AD Wilson","year":"2004","unstructured":"Wilson, A.D., King, R.E., Wilson, J.R.: Case study on statistically estimating minimum makespan for flow line scheduling problems. Eur. J. Oper. Res. 155, 439\u2013454 (2004)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0293-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0293-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0293-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:59:08Z","timestamp":1559278748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0293-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,27]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["293"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0293-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,27]]}}}