{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:34Z","timestamp":1774421314265,"version":"3.50.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3018618","type":"journal-article","created":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T21:05:23Z","timestamp":1598907923000},"page":"161232-161244","source":"Crossref","is-referenced-by-count":5,"title":["Effective Approaches to Solve <i>P<\/i>-Center Problem via Set Covering and SAT"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5244-790X","authenticated-orcid":false,"given":"Xiaolu","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3396-8638","authenticated-orcid":false,"given":"Yuan","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaming","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4794-9833","authenticated-orcid":false,"given":"Zhouxing","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6886-8434","authenticated-orcid":false,"given":"Chumin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9185-3233","authenticated-orcid":false,"given":"Zhipeng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14186-7_3"},{"key":"ref32","first-page":"111","article-title":"Chronological backtracking","author":"nadel","year":"2018","journal-title":"Theory and Applications of Satisfiability Testing&#x2014;SAT"},{"key":"ref31","first-page":"52","article-title":"Maple-COMSPS, MapleCOMSPS LRB, MapleCOMSPS CHB","author":"liang","year":"2016","journal-title":"Proc SAT Competition"},{"key":"ref30","first-page":"123","article-title":"Learning rate based branching heuristic for SAT solvers","author":"liang","year":"2016","journal-title":"Proc Int Conf Theory Appl Satisfiability Test"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9437-8"},{"key":"ref36","first-page":"436","article-title":"Coprocessor 2.0&#x2014;A flexible CNF simplifier","author":"manthey","year":"2012","journal-title":"Proc Int Conf Theory Appl Satisfiability Test"},{"key":"ref35","first-page":"399","article-title":"Predicting learnt clauses quality in modern SAT solvers","author":"audemard","year":"2009","journal-title":"Proc 21st Int Joint Conf Artif Intell"},{"key":"ref34","first-page":"502","article-title":"An extensible SAT-solver","author":"e\u00e9n","year":"2003","journal-title":"Proc Int Conf Theory Appl Satisfiability Test"},{"key":"ref10","article-title":"An efficient exact algorithm for the vertex p-center problem","author":"ilhan","year":"2001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10852-004-4072-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/net.10081"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2008.16.3.417"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-017-1802-3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.07.016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2010-314"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990309"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","article-title":"A memetic algorithm for graph coloring","volume":"203","author":"l\u00fc","year":"2010","journal-title":"Eur J Oper Res"},{"key":"ref28","first-page":"38","article-title":"SPARROWTORISS 2018","author":"heule","year":"2018","journal-title":"Proc SAT Competition"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1012016"},{"key":"ref27","first-page":"87","article-title":"Sparrow + CP3 and SparrowToRiss","author":"balint","year":"2013","journal-title":"Proc SAT Competition"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0137040"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1030.0028"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/98"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.23.10.1133"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.07.011"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600828"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.3.462"},{"key":"ref9","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":"Comm Oper Res Soc of Japan"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/net.21728"},{"key":"ref22","first-page":"827","article-title":"Towards an optimal CNF encoding of Boolean cardinality constraints","author":"sinz","year":"2005","journal-title":"Proc Princ Pract Constraint Program"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2835302"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1038\/sj\/jors\/0411109"},{"key":"ref26","first-page":"29","article-title":"Maple_LCM_Dist_ChronoBT: Featuring chronological backtracking","author":"ryvchin","year":"2018","journal-title":"Proc SAT Competition"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.103197"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09181511.pdf?arnumber=9181511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T03:39:24Z","timestamp":1643168364000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9181511\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3018618","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}