{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T17:39:47Z","timestamp":1732037987745},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"publisher","award":["201222\/2014-0"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","award":["435824-2013"],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1016\/j.cor.2018.11.006","type":"journal-article","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T08:30:33Z","timestamp":1542702633000},"page":"211-220","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":33,"special_numbering":"C","title":["A scalable exact algorithm for the vertex p-center problem"],"prefix":"10.1016","volume":"103","author":[{"given":"Claudio","family":"Contardo","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Iori","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7982-1068","authenticated-orcid":false,"given":"Raphael","family":"Kramer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cor.2018.11.006_bib0001","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10852-004-4072-3","article-title":"Enhancements to two exact algorithms for solving the vertex p-center problem","volume":"4","author":"Al-khedhairi","year":"2005","journal-title":"J. Math. Modell. Algo."},{"issue":"1","key":"10.1016\/j.cor.2018.11.006_bib0002","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.ejor.2009.02.022","article-title":"Lagrangean duals and exact solution to the capacitated p-center problem","volume":"201","author":"Albareda-Sambola","year":"2010","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2018.11.006_bib0003","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s10898-018-0634-1","article-title":"A sampling-based exact algorithm for the solution of the minimax diameter clustering problem","volume":"71","author":"Aloise","year":"2018","journal-title":"J. Global Optim."},{"key":"10.1016\/j.cor.2018.11.006_sbref0004","article-title":"The connected p-center problem on cactus graphs","author":"Bai","year":"2017","journal-title":"Theor. Comput. Sci"},{"issue":"4","key":"10.1016\/j.cor.2018.11.006_bib0005","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.orl.2008.02.001","article-title":"A new formulation for the conditional p-median and p-center problems","volume":"36","author":"Berman","year":"2008","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.cor.2018.11.006_bib0006","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1137\/141000671","article-title":"Julia: a fresh approach to numerical computing","volume":"59","author":"Bezanson","year":"2017","journal-title":"SIAM Rev."},{"key":"10.1016\/j.cor.2018.11.006_bib0007","series-title":"Location Science","first-page":"79","article-title":"p-center problems","author":"Calik","year":"2015"},{"issue":"12","key":"10.1016\/j.cor.2018.11.006_bib0008","doi-asserted-by":"crossref","first-page":"2991","DOI":"10.1016\/j.cor.2013.07.011","article-title":"Double bound method for solving the p-center location problem","volume":"40","author":"Calik","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2018.11.006_sbref0009","doi-asserted-by":"crossref","DOI":"10.1080\/01605682.2017.1421854","article-title":"Optimal solutions for the continuous p-centre problem and related \u03b1-neighbour and conditional problems: a relaxation-based algorithm","author":"Callaghan","year":"2018","journal-title":"J. Oper. Res. Soc"},{"issue":"3","key":"10.1016\/j.cor.2018.11.006_bib0010","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.ejor.2016.08.038","article-title":"Speeding up the optimal method of Drezner for the p-centre problem in the plane","volume":"257","author":"Callaghan","year":"2017","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2018.11.006_bib0011","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0377-2217(02)00464-2","article-title":"Dominant, an algorithm for the p-center problem","volume":"149","author":"Caruso","year":"2003","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2018.11.006_bib0012","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0020-0190(97)00224-X","article-title":"The p-neighbor k-center problem","volume":"65","author":"Chaudhuri","year":"1998","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"10.1016\/j.cor.2018.11.006_bib0013","doi-asserted-by":"crossref","first-page":"1646","DOI":"10.1016\/j.cor.2008.03.009","article-title":"New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems","volume":"36","author":"Chen","year":"2009","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2018.11.006_bib0014","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2012.09.041","article-title":"Optimal algorithms for the \u03b1-neighbor p-center problem","volume":"225","author":"Chen","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2018.11.006_bib0015","series-title":"Algorithms and Computation","first-page":"584","article-title":"Efficient algorithms for the weighted k-center problem on a real line","author":"Chen","year":"2011"},{"issue":"6","key":"10.1016\/j.cor.2018.11.006_bib0016","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1002\/1520-6750(198712)34:6<775::AID-NAV3220340603>3.0.CO;2-N","article-title":"Relaxation method for the solution of the minimax location-allocation problem in euclidean space","volume":"34","author":"Chen","year":"1987","journal-title":"Nav. Res. Logist."},{"issue":"1","key":"10.1016\/j.cor.2018.11.006_bib0017","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1002\/1520-6750(199302)40:1<117::AID-NAV3220400108>3.0.CO;2-0","article-title":"The conditional p-center problem in the plane","volume":"40","author":"Chen","year":"1993","journal-title":"Nav. Res. Logist."},{"issue":"6","key":"10.1016\/j.cor.2018.11.006_bib0018","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1111\/j.1475-3995.2000.tb00216.x","article-title":"A modeling framework for hospital location and service allocation","volume":"7","author":"Chu","year":"2000","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.cor.2018.11.006_bib0019","series-title":"Facility Location: Applications and Theory","first-page":"81","article-title":"Discrete network location models","author":"Current","year":"2002"},{"key":"10.1016\/j.cor.2018.11.006_bib0020","series-title":"Network and Discrete Location: Models, Algorithms, and Applications","first-page":"154","article-title":"Center problems","author":"Daskin","year":"1995"},{"key":"10.1016\/j.cor.2018.11.006_bib0021","series-title":"Network and Discrete Location: Models, Algorithms, and Applications","year":"1995"},{"issue":"9","key":"10.1016\/j.cor.2018.11.006_bib0022","first-page":"428","article-title":"A new approach to solving the vertex p-center problem to optimality: algorithm and computational results","volume":"45","author":"Daskin","year":"2000","journal-title":"Commun. Oper. Res. Soc. Jpn."},{"issue":"1","key":"10.1016\/j.cor.2018.11.006_bib0023","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1287\/trsc.23.1.51","article-title":"Conditional p-center problems","volume":"23","author":"Drezner","year":"1989","journal-title":"Transp. Sci."},{"issue":"2","key":"10.1016\/j.cor.2018.11.006_bib0024","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1137\/15M1020575","article-title":"Jump: a modeling language for mathematical optimization","volume":"59","author":"Dunning","year":"2017","journal-title":"SIAM Rev."},{"issue":"1","key":"10.1016\/j.cor.2018.11.006_bib0025","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/ijoc.1030.0028","article-title":"A new formulation and resolution method for the p-center problem","volume":"16","author":"Elloumi","year":"2004","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"10.1016\/j.cor.2018.11.006_bib0026","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10479-008-0344-z","article-title":"Aggregation error for location models: survey and analysis","volume":"167","author":"Francis","year":"2009","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2018.11.006_bib0027","series-title":"Facility Layout and Location: an Analytical Approach","author":"Francis","year":"1992"},{"issue":"4","key":"10.1016\/j.cor.2018.11.006_bib0028","doi-asserted-by":"crossref","first-page":"857","DOI":"10.2307\/2528823","article-title":"A general coefficient of similarity and some of its properties","volume":"27","author":"Gower","year":"1971","journal-title":"Biometrics"},{"issue":"1","key":"10.1016\/j.cor.2018.11.006_bib0029","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.ejor.2016.03.040","article-title":"An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization","volume":"254","author":"Grangier","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2018.11.006_bib0030","unstructured":"Gurobi Optimization, Inc., 2017. Gurobi optimizer reference manual."},{"issue":"3","key":"10.1016\/j.cor.2018.11.006_bib0031","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","article-title":"Optimum locations of switching centers and the absolute centers and medians of a graph","volume":"12","author":"Hakimi","year":"1964","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2018.11.006_bib0032","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10618-009-0135-4","article-title":"Solving large p-median clustering problems by primal\u2013dual variable neighborhood search","volume":"19","author":"Hansen","year":"2009","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.cor.2018.11.006_sbref0032","series-title":"Technical Report","article-title":"An efficient exact algorithm for the vertex p-center problem and computational experiments for different set covering subproblems","author":"Ilhan","year":"2002"},{"key":"10.1016\/j.cor.2018.11.006_sbref0033","series-title":"Technical Report","article-title":"An efficient exact algorithm for the vertex p-center problem","author":"Ilhan","year":"2001"},{"issue":"4","key":"10.1016\/j.cor.2018.11.006_bib0035","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s10732-014-9277-7","article-title":"Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex p-centre problems","volume":"22","author":"Irawan","year":"2015","journal-title":"J. Heurist."},{"issue":"3","key":"10.1016\/j.cor.2018.11.006_bib0036","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","article-title":"An algorithmic approach to network location problems. I: the p-centers","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"10.1016\/j.cor.2018.11.006_bib0037","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/S0895480197329776","article-title":"The capacitated k-center problem","volume":"13","author":"Khuller","year":"2000","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.cor.2018.11.006_sbref0037","series-title":"Technical Report","article-title":"Mathematical models and search algorithms for the capacitated p-center problem","author":"Kramer","year":"2018"},{"issue":"2","key":"10.1016\/j.cor.2018.11.006_bib0039","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0020-0190(95)00141-X","article-title":"On a generalization of the p-center problem","volume":"56","author":"Krumke","year":"1995","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.cor.2018.11.006_bib0040","first-page":"21","article-title":"Maximizing user convenience and postal service efficiency in post box location","volume":"26","author":"Labb\u00e9","year":"1986","journal-title":"Belgian J. Oper. Res., Stat. Comput. Sci."},{"key":"10.1016\/j.cor.2018.11.006_bib0041","series-title":"Handbook of Metaheuristics","first-page":"362","article-title":"Iterated local search: framework and applications","author":"Louren\u00e7o","year":"2010"},{"issue":"1","key":"10.1016\/j.cor.2018.11.006_bib0042","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.ejor.2013.03.028","article-title":"Robust weighted vertex p-center model considering uncertain data: an application to emergency management","volume":"230","author":"Lu","year":"2013","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2018.11.006_bib0043","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ejor.2017.03.043","article-title":"The probabilistic p-center problem: planning service for potential customers","volume":"262","author":"Mart\u00ednez-Merino","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2018.11.006_bib0044","first-page":"57","article-title":"The computational complexity of the m-center problems on the plane","volume":"E64","author":"Masuyama","year":"1981","journal-title":"Trans. IECE Jpn."},{"issue":"1","key":"10.1016\/j.cor.2018.11.006_bib0045","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1137\/1012016","article-title":"The m-center problem","volume":"12","author":"Minieka","year":"1970","journal-title":"SIAM Rev."},{"issue":"5","key":"10.1016\/j.cor.2018.11.006_bib0046","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1016\/j.cor.2004.09.035","article-title":"An exact algorithm for the capacitated vertex p-center problem","volume":"33","author":"\u00d6zsoy","year":"2006","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2018.11.006_bib0047","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1287\/opre.25.4.563","article-title":"Mathematical programming and the location of fire companies for the Denver fire department","volume":"25","author":"Plane","year":"1977","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2018.11.006_bib0048","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1287\/mnsc.29.4.482","article-title":"State of the art\u2013location on networks: a survey. Part I: the p-center and p-median problems","volume":"29","author":"Tansel","year":"1983","journal-title":"Manage. Sci."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054818302910?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054818302910?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T20:58:23Z","timestamp":1544821103000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054818302910"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":48,"alternative-id":["S0305054818302910"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2018.11.006","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2019,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A scalable exact algorithm for the vertex p-center problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2018.11.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1016%2FJ.COR.2018.11.006', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid884' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:884', '*');; return false;" style='text-decoration: none; '>Idea </a> <a style='color: white;' href='#diffid884'><sup>1</sup></a></div><div><a href='#diffid119' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:119', '*');; return false;" style='text-decoration: none; '>idea </a> <a style='color: white;' href='#diffid119'><sup>1</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>