{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:32:26Z","timestamp":1742387546627,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2016,4,26]],"date-time":"2016-04-26T00:00:00Z","timestamp":1461628800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61370156, 61503074, 61502464"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004602","name":"Program for New Century Excellent Talents in University (CN)","doi-asserted-by":"publisher","award":["NCET-13-0724"],"id":[{"id":"10.13039\/501100004602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00521-016-2324-6","type":"journal-article","created":{"date-parts":[[2016,4,26]],"date-time":"2016-04-26T07:05:38Z","timestamp":1461654338000},"page":"143-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["A path cost-based GRASP for minimum independent dominating set problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Yiyuan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Ruizhi","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yupeng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,26]]},"reference":[{"issue":"2","key":"2324_CR1","first-page":"162","volume":"6","author":"K Erciyes","year":"2007","unstructured":"Erciyes K, Dagdeviren O, Cokuslu D et al (2007) Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks. Appl. Comput. Math 6(2):162\u2013180","journal-title":"Appl. Comput. Math"},{"key":"2324_CR2","first-page":"76","volume":"28","author":"Y Chen","year":"2004","unstructured":"Chen Y, Liestman A, Liu J (2004) Clustering algorithms for ad hoc wireless networks. Ad Hoc and Sensor Networks 28:76","journal-title":"Ad Hoc and Sensor Networks"},{"issue":"7","key":"2324_CR3","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1109\/49.622910","volume":"15","author":"CR Lin","year":"1997","unstructured":"Lin CR, Gerla M (1997) Adaptive clustering for mobile wireless networks. Selected Areas in Communications, IEEE Journal on 15(7):1265\u20131275","journal-title":"Selected Areas in Communications, IEEE Journal on"},{"issue":"1\u20134","key":"2324_CR4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/A:1023447105713","volume":"22","author":"FG Nocetti","year":"2003","unstructured":"Nocetti FG, Gonzalez JS, Stojmenovic I (2003) Connectivity based k-hop clustering in wireless networks. Telecommunication systems 22(1\u20134):205\u2013220","journal-title":"Telecommunication systems"},{"key":"2324_CR5","doi-asserted-by":"crossref","unstructured":"Basagni S (1999) Distributed clustering for ad hoc networks. In: Proceedings of the 1999 international symposium on parallel architectures, algorithms and networks. IEEE Computer Society, pp 310\u2013315","DOI":"10.1109\/ISPAN.1999.778957"},{"key":"2324_CR6","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/MC.2008.441","volume":"10","author":"JA Stankovic","year":"2008","unstructured":"Stankovic JA (2008) Wireless sensor networks. Computer 10:92\u201395","journal-title":"Computer"},{"issue":"6","key":"2324_CR7","doi-asserted-by":"crossref","first-page":"436","DOI":"10.4304\/jnw.4.6.436-444","volume":"4","author":"AC Santos","year":"2009","unstructured":"Santos AC, Bendali F, Mailfert J et al (2009) Heuristics for designing energy-efficient wireless sensor network topologies. Journal of networks 4(6):436\u2013444","journal-title":"Journal of networks"},{"issue":"4","key":"2324_CR8","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.adhoc.2004.04.003","volume":"2","author":"IF Akyildiz","year":"2004","unstructured":"Akyildiz IF, Kasimoglu IH (2004) Wireless sensor and actor networks: research challenges. Ad Hoc Netw 2(4):351\u2013367","journal-title":"Ad Hoc Netw"},{"key":"2324_CR9","doi-asserted-by":"crossref","unstructured":"McLaughlan B, Akkaya K (2007) Coverage-based clustering of wireless sensor and actor networks. In: IEEE international conference on pervasive services. IEEE, pp 45\u201354","DOI":"10.1109\/PERSER.2007.4283888"},{"key":"2324_CR10","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"RG Michael","year":"1979","unstructured":"Michael RG, David SJ (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman, San Francisco"},{"issue":"4","key":"2324_CR11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0020-0190(93)90022-2","volume":"46","author":"MM Halld\u00f3rsson","year":"1993","unstructured":"Halld\u00f3rsson MM (1993) Approximating the minimum maximal independence number. Information Processing Letters 46(4):169\u2013172","journal-title":"Information Processing Letters"},{"issue":"7","key":"2324_CR12","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1016\/j.disc.2012.11.031","volume":"313","author":"W Goddard","year":"2013","unstructured":"Goddard W, Henning MA (2013) Independent domination in graphs: a survey and recent results. Discrete Mathematics 313(7):839\u2013854","journal-title":"Discrete Mathematics"},{"issue":"3","key":"2324_CR13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson DS, Yannakakis M, Papadimitriou CH (1988) On generating all maximal independent sets. Information Processing Letters 27(3):119\u2013123","journal-title":"Information Processing Letters"},{"issue":"1","key":"2324_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon JW, Moser L (1965) On cliques in graphs. Israel journal of Mathematics 3(1):23\u201328","journal-title":"Israel journal of Mathematics"},{"key":"2324_CR15","first-page":"78","volume-title":"A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. Graph-theoretic concepts in computer science","author":"S Gaspers","year":"2006","unstructured":"Gaspers S, Liedloff M (2006) A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. Graph-theoretic concepts in computer science. Springer, Berlin, pp 78\u201389"},{"key":"2324_CR16","first-page":"439","volume-title":"Exact algorithms for finding the minimum independent dominating set in graphs. Algorithms and computation","author":"C Liu","year":"2006","unstructured":"Liu C, Song Y (2006) Exact algorithms for finding the minimum independent dominating set in graphs. Algorithms and computation. Springer, Berlin, pp 439\u2013448"},{"issue":"4","key":"2324_CR17","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/j.dam.2012.01.003","volume":"161","author":"N Bourgeois","year":"2013","unstructured":"Bourgeois N, Della Croce F, Escoffier B et al (2013) Fast algorithms for min independent dominating set. Discrete Applied Mathematics 161(4):558\u2013572","journal-title":"Discrete Applied Mathematics"},{"key":"2324_CR18","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1613\/jair.3907","volume":"46","author":"SW Cai","year":"2013","unstructured":"Cai SW, Su KL, Luo C et al (2013) Numvc: an efficient local search algorithm for minimum vertex cover. J Artif Intell Res 46:687\u2013716","journal-title":"J Artif Intell Res"},{"issue":"7","key":"2324_CR19","first-page":"1","volume":"57","author":"P Huang","year":"2014","unstructured":"Huang P, Yin M (2014) An upper (lower) bound for max (min) CSP. Science China Information Sciences 57(7):1\u20139","journal-title":"Science China Information Sciences"},{"issue":"3","key":"2324_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11432-014-5154-0","volume":"58","author":"J Gao","year":"2015","unstructured":"Gao J, Wang J, Yin M (2015) Experimental analyses on phase transitions in compiling satisfiability problems. Science China Information Sciences 58(3):1\u201311","journal-title":"Science China Information Sciences"},{"key":"2324_CR21","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.ins.2014.11.042","volume":"298","author":"X Li","year":"2015","unstructured":"Li X, Yin M (2015) Modified Cuckoo search algorithm with self adaptive parameter method. Inf Sci 298:80\u201397","journal-title":"Inf Sci"},{"key":"2324_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-015-5377-8","author":"YY Wang","year":"2015","unstructured":"Wang YY, Ouyang DT, Zhang L et al (2015) A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity. Sci China Inf Sci. doi: 10.1007\/s11432-015-5377-8","journal-title":"Sci China Inf Sci"},{"key":"2324_CR23","doi-asserted-by":"crossref","unstructured":"Wang YY, Cai SW, Yin MH (2016) Two efficient local search algorithms for maximum weight clique problem. In: AAAI","DOI":"10.1609\/aaai.v30i1.10067"},{"issue":"7\u20138","key":"2324_CR24","doi-asserted-by":"crossref","first-page":"1867","DOI":"10.1007\/s00521-013-1433-8","volume":"24","author":"X Li","year":"2014","unstructured":"Li X, Zhang J, Yin M (2014) Animal migration optimization: an optimization algorithm inspired by animal migration behavior. Neural Comput Appl 24(7\u20138):1867\u20131877","journal-title":"Neural Comput Appl"},{"issue":"6","key":"2324_CR25","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1007\/s00521-013-1354-6","volume":"24","author":"X Li","year":"2014","unstructured":"Li X, Wang J, Yin M (2014) Enhancing the performance of cuckoo search algorithm using orthogonal learning method. Neural Comput Appl 24(6):1233\u20131247","journal-title":"Neural Comput Appl"},{"issue":"3\u20134","key":"2324_CR26","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/s00521-012-1285-7","volume":"24","author":"X Li","year":"2014","unstructured":"Li X, Yin M (2014) Self adaptive constrained Artificial Bee Colony for constrained numerical optimization. Neural Comput Appl 24(3\u20134):723\u2013734","journal-title":"Neural Comput Appl"},{"key":"2324_CR27","doi-asserted-by":"publisher","unstructured":"Li R, Hu S, Wang Y, Yin M A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem. Neural Comput Appl. doi: 10.1007\/s00521-015-2172-9","DOI":"10.1007\/s00521-015-2172-9"},{"key":"2324_CR28","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-1-4615-1507-4_15","volume-title":"GRASP: an annotated bibliography. Essays and surveys in metaheuristics","author":"P Festa","year":"2002","unstructured":"Festa P, Resende MGC (2002) GRASP: an annotated bibliography. Essays and surveys in metaheuristics. Springer, Berlin, pp 325\u2013367"},{"issue":"1","key":"2324_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00663.x","volume":"16","author":"P Festa","year":"2009","unstructured":"Festa P, Resende MGC (2009) An annotated bibliography of GRASP\u2013Part I: algorithms. International Transactions in Operational Research 16(1):1\u201324","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"2324_CR30","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/j.1475-3995.2009.00664.x","volume":"16","author":"P Festa","year":"2009","unstructured":"Festa P, Resende MGC (2009) An annotated bibliography of GRASP\u2013Part II: applications. International Transactions in Operational Research 16(2):131\u2013172","journal-title":"International Transactions in Operational Research"},{"key":"2324_CR31","first-page":"1","volume-title":"Tabu search and adaptive memory programming\u2014advances, applications and challenges. Interfaces in computer science and operations research","author":"F Glover","year":"1997","unstructured":"Glover F (1997) Tabu search and adaptive memory programming\u2014advances, applications and challenges. Interfaces in computer science and operations research. Springer, Berlin, pp 1\u201375"},{"issue":"3","key":"2324_CR32","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search-part I. ORSA Journal on computing 1(3):190\u2013206","journal-title":"ORSA Journal on computing"},{"issue":"1","key":"2324_CR33","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search\u2014part II. ORSA Journal on computing 2(1):4\u201332","journal-title":"ORSA Journal on computing"},{"key":"2324_CR34","volume-title":"Cliques, coloring, and satisfiability: second DIMACS implementation challenge","author":"DS Johnson","year":"1993","unstructured":"Johnson DS, Trick MA (1993) Cliques, coloring, and satisfiability: second DIMACS implementation challenge, vol 26. American Mathematical Society, Providence"},{"key":"2324_CR35","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"RM Aiex","year":"2007","unstructured":"Aiex RM, Resende MGC, Ribeiro CC (2007) TTT plots: a perl program to create time-to-target plots. Optimization Letters 1:355\u2013366","journal-title":"Optimization Letters"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2324-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2324-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2324-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2324-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T19:39:48Z","timestamp":1692301188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2324-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,26]]},"references-count":35,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["2324"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2324-6","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2016,4,26]]}}}