{"id":"https://openalex.org/W2618599606","doi":"https://doi.org/10.1007/s00291-017-0482-2","title":"A VNS-LP algorithm for the robust dynamic maximal covering location problem","display_name":"A VNS-LP algorithm for the robust dynamic maximal covering location problem","publication_year":2017,"publication_date":"2017-05-29","ids":{"openalex":"https://openalex.org/W2618599606","doi":"https://doi.org/10.1007/s00291-017-0482-2","mag":"2618599606"},"language":"en","primary_location":{"id":"doi:10.1007/s00291-017-0482-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00291-017-0482-2","pdf_url":null,"source":{"id":"https://openalex.org/S2502551423","display_name":"OR Spectrum","issn_l":"0171-6468","issn":["0171-6468","1436-6304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"OR Spectrum","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069650151","display_name":"Stefan Mi\u0161kovi\u0107","orcid":"https://orcid.org/0000-0002-0800-2073"},"institutions":[{"id":"https://openalex.org/I4068193","display_name":"University of Belgrade","ror":"https://ror.org/02qsmb048","country_code":"RS","type":"education","lineage":["https://openalex.org/I4068193"]}],"countries":["RS"],"is_corresponding":true,"raw_author_name":"Stefan Mi\u0161kovi\u0107","raw_affiliation_strings":["Faculty of Mathematics, University of Belgrade, Studentski trg 16, Belgrade, Serbia"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, University of Belgrade, Studentski trg 16, Belgrade, Serbia","institution_ids":["https://openalex.org/I4068193"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069650151"],"corresponding_institution_ids":["https://openalex.org/I4068193"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.49,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.86449352,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"39","issue":"4","first_page":"1011","last_page":"1033"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9825000166893005,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7452267408370972},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.715745210647583},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7082155346870422},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5501174330711365},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5344367027282715},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5327921509742737},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4749848246574402},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4564738869667053},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4519665837287903},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43623900413513184},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.42116957902908325},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.41367584466934204},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.1971365213394165},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.1557474136352539},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.14965465664863586}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7452267408370972},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.715745210647583},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7082155346870422},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5501174330711365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5344367027282715},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5327921509742737},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4749848246574402},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4564738869667053},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4519665837287903},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43623900413513184},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.42116957902908325},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.41367584466934204},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.1971365213394165},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.1557474136352539},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.14965465664863586},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00291-017-0482-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00291-017-0482-2","pdf_url":null,"source":{"id":"https://openalex.org/S2502551423","display_name":"OR Spectrum","issn_l":"0171-6468","issn":["0171-6468","1436-6304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"OR Spectrum","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:orspec:v:39:y:2017:i:4:d:10.1007_s00291-017-0482-2","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s00291-017-0482-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.44999998807907104,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G5012871664","display_name":null,"funder_award_id":"044006","funder_id":"https://openalex.org/F4320322729","funder_display_name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja"}],"funders":[{"id":"https://openalex.org/F4320322729","display_name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","ror":"https://ror.org/01znas443"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W41176963","https://openalex.org/W58481735","https://openalex.org/W134281200","https://openalex.org/W844631126","https://openalex.org/W1493213455","https://openalex.org/W1557201052","https://openalex.org/W1572130003","https://openalex.org/W1653776110","https://openalex.org/W1963888335","https://openalex.org/W1971201170","https://openalex.org/W1978742935","https://openalex.org/W1990275757","https://openalex.org/W1995285162","https://openalex.org/W2003777645","https://openalex.org/W2004389393","https://openalex.org/W2010334716","https://openalex.org/W2023174570","https://openalex.org/W2036187086","https://openalex.org/W2044028040","https://openalex.org/W2048267107","https://openalex.org/W2048679451","https://openalex.org/W2050000782","https://openalex.org/W2084575717","https://openalex.org/W2089105401","https://openalex.org/W2093182489","https://openalex.org/W2093612088","https://openalex.org/W2113854449","https://openalex.org/W2118578357","https://openalex.org/W2133613508","https://openalex.org/W2137272782","https://openalex.org/W2163551942","https://openalex.org/W2165775468","https://openalex.org/W2171600842","https://openalex.org/W2227896773","https://openalex.org/W2255708520","https://openalex.org/W2266816739","https://openalex.org/W2561675875","https://openalex.org/W2935852545","https://openalex.org/W4238107244","https://openalex.org/W4253347690","https://openalex.org/W4292872700"],"related_works":["https://openalex.org/W2162520330","https://openalex.org/W1985593761","https://openalex.org/W4385400069","https://openalex.org/W2136892294","https://openalex.org/W2001078004","https://openalex.org/W2740820201","https://openalex.org/W2015682010","https://openalex.org/W2608348709","https://openalex.org/W2568008548","https://openalex.org/W2321338106"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}