{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T14:21:58Z","timestamp":1768400518892,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T00:00:00Z","timestamp":1496016000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja (RS)","doi-asserted-by":"publisher","award":["044006"],"award-info":[{"award-number":["044006"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s00291-017-0482-2","type":"journal-article","created":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T10:50:49Z","timestamp":1496055049000},"page":"1011-1033","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A VNS-LP algorithm for the robust dynamic maximal covering location problem"],"prefix":"10.1007","volume":"39","author":[{"given":"Stefan","family":"Mi\u0161kovi\u0107","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,29]]},"reference":[{"key":"482_CR1","unstructured":"Arakaki RGI, Lorena LAN (2001) A constructive genetic algorithm for the maximal covering location problem. In: Proceedings of metaheuristics international conference, pp 13\u201317"},{"issue":"4","key":"482_CR2","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10288-013-0231-6","volume":"11","author":"E \u00c1lvarez-Miranda","year":"2013","unstructured":"\u00c1lvarez-Miranda E, Ljubi\u0107 I, Toth P (2013) A note on the Bertsimas and Sim algorithm for robust combinatorial optimization problems. 4OR-Q. J Oper Res 11(4):349\u2013360","journal-title":"J Oper Res"},{"key":"482_CR3","first-page":"21","volume":"16","author":"M Ball","year":"2011","unstructured":"Ball M (2011) Heuristics based on mathematical programming. Surv Oper Res Manag Sci 16:21\u201338","journal-title":"Surv Oper Res Manag Sci"},{"key":"482_CR4","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Oper Res 23:769\u2013805","journal-title":"Math Oper Res"},{"key":"482_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal A, Nemirovski A (1999) Robust solutions to uncertain programs. Oper Res Lett 25:1\u201313","journal-title":"Oper Res Lett"},{"key":"482_CR6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math Program 88:411\u2013424","journal-title":"Math Program"},{"key":"482_CR7","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(01)00079-X","volume":"29","author":"O Berman","year":"2002","unstructured":"Berman O, Krass D (2002) The generalized maximal covering location problem. Comput Oper Res 29:563\u2013581","journal-title":"Comput Oper Res"},{"issue":"1","key":"482_CR8","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1111\/j.1538-4632.2009.00746.x","volume":"41","author":"O Berman","year":"2009","unstructured":"Berman O, Drezner Z, Wesolowsky GO (2009) The maximal covering problem with some negative weights. Geogr Anal 41(1):30\u201342","journal-title":"Geogr Anal"},{"key":"482_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program 98:49\u201371","journal-title":"Math Program"},{"issue":"1","key":"482_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1):35\u201353","journal-title":"Oper Res"},{"key":"482_CR11","first-page":"171","volume-title":"Lecture notes in computer science","author":"MA Boschetti","year":"2009","unstructured":"Boschetti MA, Maniezzo V, Roffilli M, Rhler AB (2009) Matheuristics: optimization, simulation and control. In: Blesa MJ, Blum C, Di Caspero L, Roli A, Sampels M, Schraef A (eds) Lecture notes in computer science, vol 5818. Springer, Berlin, pp 171\u2013177"},{"issue":"24","key":"482_CR12","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1111\/j.1467-9787.1984.tb01031.x","volume":"2","author":"RL Church","year":"1984","unstructured":"Church RL (1984) The planar maximal covering location problem. J Reg Sci 2(24):185\u2013201","journal-title":"J Reg Sci"},{"key":"482_CR13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01942293","volume":"32","author":"RL Church","year":"1974","unstructured":"Church RL, ReVelle CS (1974) The maximal covering location problem. Pap Reg Sci Assoc 32:101\u2013118","journal-title":"Pap Reg Sci Assoc"},{"key":"482_CR14","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.cor.2015.09.003","volume":"67","author":"F Colombo","year":"2016","unstructured":"Colombo F, Cordone R, Lulli G (2016) The multimode covering location problem. Comput Oper Res 67:25\u201333","journal-title":"Comput Oper Res"},{"key":"482_CR15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s11067-007-9035-6","volume":"10","author":"KM Curtin","year":"2007","unstructured":"Curtin KM, Hayslett K, Qiu F (2007) Determining optimal police patrol areas with maximal covering and backup covering location models. Netw Spat Econ 10:125\u2013145","journal-title":"Netw Spat Econ"},{"key":"482_CR16","volume-title":"Network and discrete location: models, algorithms, and applications","author":"MS Daskin","year":"2011","unstructured":"Daskin MS (2011) Network and discrete location: models, algorithms, and applications. Wiley, New York"},{"key":"482_CR17","first-page":"309","volume-title":"Delay management in health care systems","author":"M Dessouky","year":"2006","unstructured":"Dessouky M, Ordonez F, Jia H, Shen Z (2006) Rapid distribution of medical supplies. Delay management in health care systems. Springer, New York, pp 309\u2013338"},{"key":"482_CR18","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S0895479896298130","volume":"18","author":"L El-Ghaoui","year":"1997","unstructured":"El-Ghaoui L, Lebret H (1997) Robust solutions to least-square problems to uncertain data matrices. SIAM J Matrix Anal A 18:1035\u20131064","journal-title":"SIAM J Matrix Anal A"},{"key":"482_CR19","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1052623496305717","volume":"9","author":"L El-Ghaoui","year":"1998","unstructured":"El-Ghaoui L, Oustry F, Lebret H (1998) Robust solutions to uncertain semidefinite programs. SIAM J Optim 9:33\u201352","journal-title":"SIAM J Optim"},{"issue":"1","key":"482_CR20","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)00159-6","volume":"88","author":"RD Galvao","year":"1996","unstructured":"Galvao RD, ReVelle C (1996) A Lagrangian heuristic for the maximal covering location problem. Eur J Oper Res 88(1):114\u2013123","journal-title":"Eur J Oper Res"},{"key":"482_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer, Norwell"},{"key":"482_CR22","volume-title":"Matheuristics: hybridizing metaheuristics and mathematical programming","author":"V Maniezzo","year":"2009","unstructured":"Maniezzo V, Stutzle T, Voss S (2009) Matheuristics: hybridizing metaheuristics and mathematical programming. Springer, New York"},{"issue":"3","key":"482_CR23","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1111\/0022-4146.00100","volume":"38","author":"V Marianov","year":"1998","unstructured":"Marianov V, Serra D (1998) Probabilistic, maximal covering location allocation models for congested systems. J Reg Sci 38(3):401\u2013424","journal-title":"J Reg Sci"},{"issue":"11","key":"482_CR24","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"key":"482_CR25","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2005","unstructured":"Montgomery DC (2005) Design and analysis of experiments, 6th edn. Wiley, New York","edition":"6"},{"key":"482_CR26","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/11499305_5","volume":"3562","author":"J Puchinger","year":"2005","unstructured":"Puchinger J, Raidl GR (2005) Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification. Lect Notes Comput Sci 3562:41\u201353","journal-title":"Lect Notes Comput Sci"},{"issue":"3","key":"482_CR27","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.cor.2006.04.003","volume":"35","author":"HK Rajagopalan","year":"2008","unstructured":"Rajagopalan HK, Saydam C, Xiao J (2008) A multiperiod set covering location model for dynamic redeployment of ambulances. Comput Oper Res 35(3):814\u2013826","journal-title":"Comput Oper Res"},{"key":"482_CR28","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/trsc.23.3.192","volume":"23","author":"C ReVelle","year":"1989","unstructured":"ReVelle C, Hogan K (1989) The maximum availability location problem. Transp Sci 23:192\u2013200","journal-title":"Transp Sci"},{"key":"482_CR29","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21:1154\u20131157","journal-title":"Oper Res"},{"issue":"4","key":"482_CR30","doi-asserted-by":"crossref","first-page":"206","DOI":"10.3138\/infor.52.4.206","volume":"52","author":"Z Stanimirovi\u0107","year":"2014","unstructured":"Stanimirovi\u0107 Z, Gruji\u010di\u0107 I, Trifunovi\u0107 D (2014) Modeling the emergency service network of police special forces units for high-risk law enforcement operations. INFOR Inform Syst Oper Res 52(4):206\u2013226","journal-title":"INFOR Inform Syst Oper Res"},{"key":"482_CR31","unstructured":"Taka\u010devi\u0107 A, Mari\u0107 M, Drakuli\u0107 D (2012) The role of fuzzy sets in improving maximal covering location problem (MCLP). In: Intelligent systems and informatics (SISY), 2012 IEEE 10th jubilee international symposium, pp 103\u2013106"},{"key":"482_CR32","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1111\/j.1538-4632.1974.tb00513.x","volume":"6","author":"JA White","year":"1974","unstructured":"White JA, Case KE (1974) On covering problems and the central facilities location problem. Geogr Anal 6:281\u2013293","journal-title":"Geogr Anal"},{"issue":"3","key":"482_CR33","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1016\/j.mcm.2012.07.028","volume":"57","author":"MHF Zarandi","year":"2013","unstructured":"Zarandi MHF, Davari S, Sisakht SAH (2013) The large-scale dynamic maximal covering location problem. Math Comput Model 57(3):710\u2013719","journal-title":"Math Comput Model"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-017-0482-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-017-0482-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-017-0482-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,25]],"date-time":"2017-09-25T09:36:44Z","timestamp":1506332204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-017-0482-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,29]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["482"],"URL":"https:\/\/doi.org\/10.1007\/s00291-017-0482-2","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,29]]}}}