{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T16:33:57Z","timestamp":1720110837920},"reference-count":30,"publisher":"Informa UK Limited","issue":"6","license":[{"start":{"date-parts":[[2018,1,16]],"date-time":"2018-01-16T00:00:00Z","timestamp":1516060800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of the Operational Research Society"],"published-print":{"date-parts":[[2018,6,3]]},"DOI":"10.1057\/s41274-017-0268-6","type":"journal-article","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T12:18:40Z","timestamp":1501503520000},"page":"849-863","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":7,"title":["A novel local search algorithm for the minimum capacitated dominating set"],"prefix":"10.1080","volume":"69","author":[{"given":"Ruizhi","family":"Li","sequence":"first","affiliation":[{"name":"School of Computer Science and Information Technology, Northeast Normal University, Changchun, China"}]},{"given":"Shuli","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Technology, Northeast Normal University, Changchun, China"}]},{"given":"Peng","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Technology, Northeast Normal University, Changchun, China"}]},{"given":"Yupeng","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Technology, Northeast Normal University, Changchun, China"}]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Technology, Northeast Normal University, Changchun, China"},{"name":"Key Laboratory of Applied Statistics of Ministry of Education, Northeast Normal University, Changchun, China"}]}],"member":"301","published-online":{"date-parts":[[2018,1,16]]},"reference":[{"issue":"3","key":"CIT0001","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1006\/jagm.1993.1047","volume":"15","author":"Barilan J.","year":"1993","journal-title":"Journal of Algorithms"},{"key":"CIT0002","first-page":"310","volume-title":"Proceedings ISPAN-99 International Symposium on Parallel Architectures Algorithms and Networks","author":"Basagni S.","year":"1999"},{"key":"CIT0004","first-page":"376","volume-title":"Proceedings of the 1997 IEEE International Conference on Communications (ICC\u201997)","author":"Bevan D.","year":"1997"},{"key":"CIT0005","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/ICTAI.2011.18","volume-title":"23rd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE, 2011","author":"Cai S.","year":"2011"},{"issue":"9","key":"CIT0007","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.artint.2013.09.001","volume":"204","author":"Cai S.","year":"2013","journal-title":"Artificial Intelligence"},{"key":"CIT0008","first-page":"489","volume-title":"Proceedings of the Twenty- Third International Joint Conference on Artificial Intelligence","author":"Cai S.","year":"2013"},{"key":"CIT0009","unstructured":"Cygan, M., Pilipczuk, M. & Wojtaszczyk, J. O. (2010).Capacitated domination faster than O (2n). Algorithm theory-SWAT 2010(pp. 74\u201380). Berlin: Springer."},{"issue":"2","key":"CIT0010","first-page":"162","volume":"6","author":"Erciyes K.","year":"2007","journal-title":"Applied and Computational Mathematics"},{"issue":"3","key":"CIT0011","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11432-014-5154-0","volume":"58","author":"Gao J.","year":"2015","journal-title":"Science China Information Sciences"},{"issue":"9","key":"CIT0012","doi-asserted-by":"crossref","first-page":"092109","DOI":"10.1007\/s11432-016-0258-4","volume":"60","author":"Gao J.","year":"2017","journal-title":"Science China Information Sciences"},{"key":"CIT0013","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey M. R.","year":"1979"},{"key":"CIT0014","first-page":"233","volume-title":"Proceedings of CP-02","author":"Hutter F.","year":"2002"},{"key":"CIT0015","first-page":"322","volume-title":"Proceedings of the 12th WSEAS International Conference on Automatic Control, Modelling and Simulation (ACMOS\u201910)","author":"Jovanovic R.","year":"2010"},{"key":"CIT0016","doi-asserted-by":"crossref","unstructured":"Kao, M. J. & Chen, H. L. (2010).Approximation algorithms for the capacitated domination problem. Frontiers in Algorithmics(pp. 185\u2013196). Berlin: Springer.","DOI":"10.1007\/978-3-642-14553-7_19"},{"issue":"4","key":"CIT0017","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1007\/s00224-010-9271-x","volume":"47","author":"Kuhn F.","year":"2010","journal-title":"Theory of Computing Systems"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2429-y"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-2172-9"},{"issue":"12","key":"CIT0020","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.ins.2016.08.053","volume":"372","author":"Li R.","year":"2016","journal-title":"Information Sciences"},{"issue":"5","key":"CIT0021","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.dam.2012.10.021","volume":"168","author":"Liedloff M.","year":"2014","journal-title":"Discrete Applied Mathematics"},{"issue":"11","key":"CIT0022","doi-asserted-by":"crossref","first-page":"1382","DOI":"10.1057\/jors.2016.4","volume":"67","author":"Mansouri S. A.","year":"2016","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"CIT0024","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/A:1023447105713","volume":"22","author":"Nocetti F.","year":"2003","journal-title":"Telecommunication Systems"},{"key":"CIT0025","doi-asserted-by":"crossref","unstructured":"Potluri, A. & Singh, A. (2012).A greedy heuristic and its variants for minimum capacitated dominating set. Contemporary computing(pp. 28\u201339). Berlin: Springer.","DOI":"10.1007\/978-3-642-32129-0_9"},{"issue":"13","key":"CIT0026","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.swevo.2013.06.002","volume":"13","author":"Potluri A.","year":"2013","journal-title":"Swarm and Evolutionary Computation"},{"key":"CIT0027","first-page":"191","volume":"2004","author":"Thornton J.","year":"2002","journal-title":"AAAI"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2015.121"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-015-5377-8"},{"issue":"2017","key":"CIT0030","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.5205","volume":"58","author":"Wang Y.","year":"2017","journal-title":"Journal of Artificial Intelligence Research"},{"key":"CIT0031","first-page":"7","volume-title":"Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication (DIALM 1999)","author":"Wu J.","year":"1999"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2339-z"},{"issue":"1","key":"CIT0033","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1166\/jctn.2016.4869","volume":"13","author":"Zhou Y.","year":"2016","journal-title":"Journal of Computational and Theoretical Nanoscience"}],"container-title":["Journal of the Operational Research Society"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1057\/s41274-017-0268-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1057\/s41274-017-0268-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1057\/s41274-017-0268-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1057\/s41274-017-0268-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T17:10:30Z","timestamp":1569949830000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1057\/s41274-017-0268-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,16]]},"references-count":30,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2018,1,18]]},"published-print":{"date-parts":[[2018,6,3]]}},"alternative-id":["10.1057\/s41274-017-0268-6"],"URL":"https:\/\/doi.org\/10.1057\/s41274-017-0268-6","relation":{},"ISSN":["0160-5682","1476-9360"],"issn-type":[{"value":"0160-5682","type":"print"},{"value":"1476-9360","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,16]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tjor20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tjor20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}