{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T15:51:41Z","timestamp":1714319501786},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Syst., Man, Cybern. B"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1109\/tsmcb.2012.2188100","type":"journal-article","created":{"date-parts":[[2012,3,8]],"date-time":"2012-03-08T19:13:00Z","timestamp":1331233980000},"page":"1187-1202","source":"Crossref","is-referenced-by-count":7,"title":["An Accelerated-Limit-Crossing-Based Multilevel Algorithm for the $p$-Median Problem"],"prefix":"10.1109","volume":"42","author":[{"family":"Zhilei Ren","sequence":"first","affiliation":[]},{"family":"He Jiang","sequence":"additional","affiliation":[]},{"family":"Jifeng Xuan","sequence":"additional","affiliation":[]},{"family":"Zhongxuan Luo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(01)00033-8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00268-9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000019986.96257.50"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/net.20128"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2033579"},{"key":"ref30","first-page":"75","article-title":"A population based hybrid metaheuristic for the <ref_formula><tex Notation=\"TeX\">$p$<\/tex><\/ref_formula>-median problem","author":"pullan","year":"2008","journal-title":"Proc IEEE World Congr Comput Intell"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00310-X"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00100-2"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00141-5"},{"key":"ref34","first-page":"119","article-title":"On the implementation of a swap-based local search procedure for the <ref_formula><tex Notation=\"TeX\">$p$<\/tex> <\/ref_formula>-median problem","author":"resende","year":"2003","journal-title":"Proc 5th workshop Algor Eng Exp"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF00226292"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.05.034"},{"key":"ref29","first-page":"340","article-title":"Clustering at the phase transition","author":"parkes","year":"1997","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref2","author":"boese","year":"1995","journal-title":"Cost versus distance in the traveling salesman problem"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(85)90040-2"},{"key":"ref20","first-page":"1368","article-title":"Backbones and<?TeX \\protect\\linebreak?>backdoors in satisfiability","author":"kilby","year":"2005","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.851274"},{"key":"ref21","first-page":"175","article-title":"The backbone of the travelling salesperson","author":"kilby","year":"2005","journal-title":"Proc 19th Int Joint Conf Artif Intell"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771168"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2298\/YJOR0501053K"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/4235.887234"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-008-0042-0"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1062"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.001"},{"key":"ref52","first-page":"343","article-title":"A novel local search algorithm for the traveling salesman problem that exploits backbones","author":"zhang","year":"2005","journal-title":"Proc 19th Int Joint Conf Artif Intell"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/S0167-8191(03)00043-7","article-title":"Parallelization of the scatter search for the <ref_formula><tex Notation=\"TeX\">$p$<\/tex><\/ref_formula>-median problem","volume":"29","author":"garcacute a-lpez","year":"2003","journal-title":"Parallel Comput"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1023\/A:1015013919497","article-title":"The parallel variable neighborhood search for the <ref_formula><tex Notation=\"TeX\">$p$<\/tex><\/ref_formula>-median problem","volume":"8","author":"garcacute a-lpez","year":"2002","journal-title":"J Heurist"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TITB.2006.880850"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-008-9080-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2056470"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011336210885"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0966-8349(98)00030-8"},{"key":"ref16","first-page":"158","author":"hoos","year":"2005","journal-title":"Stochastic Local Search Foundations and Applications"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02027381"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0137041"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/71.932716"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.913699"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.85"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.23.8.789"},{"key":"ref5","first-page":"707","article-title":"Searching for backbone and fat: A limit-crossing approach with applications","author":"climer","year":"2002","journal-title":"Proc 18th Assoc Adv Artif Intell"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-8066-2_3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.3.233.16078"},{"key":"ref49","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1109\/TNET.2008.2001729","article-title":"Large-scale network parameter configuration using an on-line simulation framework","volume":"16","author":"ye","year":"2008","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.863628"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.915539"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/BF01165154"},{"key":"ref48","first-page":"95","article-title":"A fast algorithm for the greedy interchange for large-scale clustering and median location problems","volume":"21","author":"whitaker","year":"1983","journal-title":"INFOR"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.5.955"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4655(96)00062-8"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/69.334886"},{"key":"ref44","first-page":"115","article-title":"Lagrangean\/surrogate heuristics for <ref_formula><tex Notation=\"TeX\">$p$<\/tex><\/ref_formula>-median problems","author":"senne","year":"2000","journal-title":"Proc Comput Tools Model Optim Simul Interf Comput Sci Oper Res"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(02)00106-1"}],"container-title":["IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/3477\/6238441\/06166348.pdf?arnumber=6166348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:51:54Z","timestamp":1633909914000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6166348\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":52,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tsmcb.2012.2188100","relation":{},"ISSN":["1083-4419","1941-0492"],"issn-type":[{"value":"1083-4419","type":"print"},{"value":"1941-0492","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}