乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T18:54:53Z","timestamp":1720464893587},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Engineering Applications of Artificial Intelligence"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1016\/j.engappai.2022.105053","type":"journal-article","created":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T15:21:58Z","timestamp":1655565718000},"page":"105053","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A hybrid local search algorithm for minimum dominating set problems"],"prefix":"10.1016","volume":"114","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-8780-812X","authenticated-orcid":false,"given":"Saad Adnan","family":"Abed","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7878-965X","authenticated-orcid":false,"given":"Helmi Md","family":"Rais","sequence":"additional","affiliation":[]},{"given":"Junzo","family":"Watada","sequence":"additional","affiliation":[]},{"given":"Nasser R.","family":"Sabar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.engappai.2022.105053_b1","doi-asserted-by":"crossref","first-page":"2329","DOI":"10.3233\/JIFS-17398","article-title":"Hybrid bat algorithm for minimum dominating set problem","volume":"33","author":"Abed","year":"2017","journal-title":"J. Intell. Fuzzy Systems"},{"key":"10.1016\/j.engappai.2022.105053_b2","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/j.asoc.2018.06.052","article-title":"An efficient matheuristic for the minimum-weight dominating set problem","volume":"72","author":"Albuquerque","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.engappai.2022.105053_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.adhoc.2019.102023","article-title":"Minimum connected dominating sets in heterogeneous 3D wireless ad hoc networks","volume":"97","author":"Bai","year":"2020","journal-title":"Ad Hoc Netw."},{"key":"10.1016\/j.engappai.2022.105053_b4","series-title":"Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing","first-page":"80","article-title":"On the minimum node degree and connectivity of a wireless multihop network","author":"Bettstetter","year":"2002"},{"key":"10.1016\/j.engappai.2022.105053_b5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.simpat.2015.11.001","article-title":"A hybrid algorithmic model for the minimum weight dominating set problem","volume":"64","author":"Bouamama","year":"2016","journal-title":"Simul. Model. Pract. Theory"},{"issue":"3","key":"10.1016\/j.engappai.2022.105053_b6","doi-asserted-by":"crossref","DOI":"10.3390\/a14030079","article-title":"An improved greedy heuristic for the minimum positive influence dominating set problem in social networks","volume":"14","author":"Bouamama","year":"2021","journal-title":"Algorithms"},{"issue":"1","key":"10.1016\/j.engappai.2022.105053_b7","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2016.07.012","article-title":"The late acceptance Hill-Climbing heuristic","volume":"258","author":"Burke","year":"2017","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.engappai.2022.105053_b8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.ins.2017.10.033","article-title":"An order-based algorithm for minimum dominating set with application in graph mining","volume":"426","author":"Chalupa","year":"2018","journal-title":"Inform. Sci."},{"issue":"1","key":"10.1016\/j.engappai.2022.105053_b9","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","article-title":"Unit disk graphs","volume":"86","author":"Clark","year":"1990","journal-title":"Discrete Math."},{"issue":"11","key":"10.1016\/j.engappai.2022.105053_b10","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","article-title":"Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art","volume":"191","author":"Coello","year":"2002","journal-title":"Comput. Methods Appl. Mech. Engrg."},{"issue":"1","key":"10.1016\/j.engappai.2022.105053_b11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","article-title":"A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms","volume":"1","author":"Derrac","year":"2011","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"10.1016\/j.engappai.2022.105053_b12","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","article-title":"New optimization heuristics: The great deluge algorithm and the record-to-record travel","volume":"104","author":"Dueck","year":"1993","journal-title":"J. Comput. Phys."},{"issue":"3","key":"10.1016\/j.engappai.2022.105053_b13","first-page":"59","article-title":"An improved algorithm for finding minimum positive influence dominating sets in social networks","volume":"48","author":"Fei","year":"2016","journal-title":"J. South China Normal Univ. Natur. Sci. Ed."},{"issue":"2","key":"10.1016\/j.engappai.2022.105053_b14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","article-title":"A probabilistic heuristic for a computationally difficult set covering problem","volume":"8","author":"Feo","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.engappai.2022.105053_b15","series-title":"Computers and Intractability; a Guide To the Theory of NP-Completeness","author":"Garey","year":"1990"},{"key":"10.1016\/j.engappai.2022.105053_b16","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2020.103674","article-title":"An iterated greedy algorithm for the obnoxious p-median problem","volume":"92","author":"Gokalp","year":"2020","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2022.105053_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2020.104018","article-title":"Iterated two-phase local search for the colored traveling salesmen problem","volume":"97","author":"He","year":"2021","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2022.105053_b18","series-title":"International Conference on Computational Science and Its Applications","first-page":"457","article-title":"Hybrid genetic algorithm for minimum dominating set problem","author":"Hedar","year":"2010"},{"issue":"2","key":"10.1016\/j.engappai.2022.105053_b19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s13042-011-0043-y","article-title":"Simulated annealing with stochastic local search for minimum dominating set problem","volume":"3","author":"Hedar","year":"2012","journal-title":"Int. J. Mach. Learn. Cybern."},{"issue":"3","key":"10.1016\/j.engappai.2022.105053_b20","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1007\/s10922-018-9480-1","article-title":"Two meta-heuristics designed to solve the minimum connected dominating set problem for wireless networks design and management","volume":"27","author":"Hedar","year":"2019","journal-title":"J. Netw. Syst. Manage."},{"issue":"10","key":"10.1016\/j.engappai.2022.105053_b21","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1080\/08839510600940132","article-title":"An enhanced ant colony optimization metaheuristic for the minimum dominating set problem","volume":"20","author":"Ho","year":"2006","journal-title":"Appl. Artif. Intell."},{"issue":"2","key":"10.1016\/j.engappai.2022.105053_b22","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/j.engappai.2022.105053_b23","first-page":"1","article-title":"Minimum positive influence dominating set and its application in influence maximization: a learning automata approach","volume":"48","author":"Khomami","year":"2017","journal-title":"Appl. Intell."},{"issue":"4598","key":"10.1016\/j.engappai.2022.105053_b24","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"issue":"2","key":"10.1016\/j.engappai.2022.105053_b25","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s11390-017-1781-4","article-title":"A binary particle swarm optimization for the minimum weight dominating set problem","volume":"33","author":"Lin","year":"2018","journal-title":"J. Comput. Sci. Tech."},{"key":"10.1016\/j.engappai.2022.105053_b26","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.physa.2018.02.119","article-title":"An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks","volume":"500","author":"Lin","year":"2018","journal-title":"Physica A"},{"key":"10.1016\/j.engappai.2022.105053_b27","series-title":"Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery","first-page":"506","article-title":"A hybrid swarm intelligence-based algorithm for finding minimum positive influence dominating sets","author":"Lin","year":"2020"},{"issue":"6","key":"10.1016\/j.engappai.2022.105053_b28","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TEVC.2016.2538819","article-title":"An effective hybrid memetic algorithm for the minimum weight dominating set problem","volume":"20","author":"Lin","year":"2016","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.engappai.2022.105053_b29","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230250205","article-title":"Simple heuristics for unit disk graphs","volume":"25","author":"Marathe","year":"1995","journal-title":"Networks"},{"key":"10.1016\/j.engappai.2022.105053_b30","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.comnet.2017.05.017","article-title":"Distributed construction of minimum Connected dominating set in wireless sensor network using two-hop information","volume":"123","author":"Mohanty","year":"2017","journal-title":"Comput. Netw."},{"key":"10.1016\/j.engappai.2022.105053_b31","doi-asserted-by":"crossref","first-page":"1736","DOI":"10.1038\/srep01736","article-title":"Minimum dominating sets in scale-free network ensembles","volume":"3","author":"Moln\u00e1r","year":"2013","journal-title":"Sci. Rep."},{"key":"10.1016\/j.engappai.2022.105053_b32","series-title":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","first-page":"360","article-title":"A fast greedy algorithm for finding minimum positive influence dominating sets in social networks","author":"Pan","year":"2019"},{"key":"10.1016\/j.engappai.2022.105053_b33","doi-asserted-by":"crossref","first-page":"17527","DOI":"10.1109\/ACCESS.2018.2819083","article-title":"Dominating set algorithms for wireless sensor networks survivability","volume":"6","author":"Pino","year":"2018","journal-title":"IEEE Access"},{"key":"10.1016\/j.engappai.2022.105053_b34","series-title":"Swarm, Evolutionary, and Memetic Computing","first-page":"97","article-title":"Two hybrid meta-heuristic approaches for minimum dominating set problem","author":"Potluri","year":"2011"},{"key":"10.1016\/j.engappai.2022.105053_b35","series-title":"2012 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining","first-page":"253","article-title":"A new algorithm for positive influence dominating set in social networks","author":"Raei","year":"2012"},{"issue":"2","key":"10.1016\/j.engappai.2022.105053_b36","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1007\/s10878-016-0005-0","article-title":"Approximation algorithm for partial positive influence problem in social network","volume":"33","author":"Ran","year":"2017","journal-title":"J. Comb. Optim."},{"issue":"1","key":"10.1016\/j.engappai.2022.105053_b37","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00453-001-0101-z","article-title":"Experimental analysis of heuristic algorithms for the dominating set problem","volume":"33","author":"Sanchis","year":"2002","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/j.engappai.2022.105053_b38","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jcph.1999.6413","article-title":"Record breaking optimization results using the ruin and recreate principle","volume":"159","author":"Schrimpf","year":"2000","journal-title":"J. Comput. Phys."},{"key":"10.1016\/j.engappai.2022.105053_b39","series-title":"Proceedings of the 23rd International Conference on Computational Linguistics","first-page":"984","article-title":"Multi-document summarization via the minimum dominating set","author":"Shen","year":"2010"},{"issue":"2","key":"10.1016\/j.engappai.2022.105053_b40","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1109\/TNET.2019.2894749","article-title":"Minimum connected dominating set under routing cost constraint in wireless sensor networks with different transmission ranges","volume":"27","author":"Song","year":"2019","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.engappai.2022.105053_b41","series-title":"Combinatorial Optimization and Applications","first-page":"313","article-title":"Positive influence dominating set in online social networks","author":"Wang","year":"2009"},{"issue":"3","key":"10.1016\/j.engappai.2022.105053_b42","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.tcs.2009.10.001","article-title":"On positive influence dominating sets in social networks","volume":"412","author":"Wang","year":"2011","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.engappai.2022.105053_b43","doi-asserted-by":"crossref","DOI":"10.1088\/1742-6596\/699\/1\/012014","article-title":"Generalized minimum dominating set and application in automatic text summarization","volume":"699","author":"Xu","year":"2016","journal-title":"J. Phys. Conf. Ser."}],"container-title":["Engineering Applications of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197622002196?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197622002196?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,3,11]],"date-time":"2023-03-11T20:22:07Z","timestamp":1678566127000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0952197622002196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":43,"alternative-id":["S0952197622002196"],"URL":"https:\/\/doi.org\/10.1016\/j.engappai.2022.105053","relation":{},"ISSN":["0952-1976"],"issn-type":[{"value":"0952-1976","type":"print"}],"subject":[],"published":{"date-parts":[[2022,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A hybrid local search algorithm for minimum dominating set problems","name":"articletitle","label":"Article Title"},{"value":"Engineering Applications of Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.engappai.2022.105053","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"105053"}}