{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T22:48:14Z","timestamp":1752101294284,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030368074"},{"type":"electronic","value":"9783030368081"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36808-1_79","type":"book-chapter","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T15:04:08Z","timestamp":1575644648000},"page":"725-732","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Hybrid Evolutionary Algorithm with Taboo and Competition Strategies for Minimum Vertex Cover Problem"],"prefix":"10.1007","author":[{"given":"Gang","family":"Yang","sequence":"first","affiliation":[]},{"given":"Daopeng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jieping","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,5]]},"reference":[{"key":"79_CR1","unstructured":"Baluja, S.: Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical report CMU-CS-94-163, Computer Science Department, Pittsburgh, PA (1994)"},{"key":"79_CR2","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10051-001-8683-4","volume":"24","author":"M Bauer","year":"2001","unstructured":"Bauer, M., Golinelli, O.: Core percolation in random graphs: a critical phenomena analysis. Eur. Phys. J. B 24, 339 (2001)","journal-title":"Eur. Phys. J. B"},{"key":"79_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob","year":"2001","unstructured":"Bollob, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"79_CR4","unstructured":"Bonet, J.S.D., Isbell, Jr, C.L., Viola, P.: 1996. MIMIC: finding optima by estimating probability densities. In: Advances in Neural Information Processing Systems, vol. 424. The MIT Press (1997)"},{"issue":"1","key":"79_CR5","first-page":"687","volume":"46","author":"S Cai","year":"2013","unstructured":"Cai, S., Su, K., Luo, C., Sattar, A.: NuMVC: an efficient local search algorithm for minimum vertex cover. J. Artif. Int. Res. 46(1), 687\u2013716 (2013)","journal-title":"J. Artif. Int. Res."},{"key":"79_CR6","doi-asserted-by":"crossref","unstructured":"Cai, S., Su, K., Chen, Q.: EWLS: a new local search for minimum vertex cover. In: AAAI Conference on Artificial Intelligence (2010)","DOI":"10.1609\/aaai.v24i1.7539"},{"key":"79_CR7","unstructured":"Chickering, D., Heckerman, D., Meek, C.: A Bayesian approach to learning Bayesian networks with local structure. Technical report MSR-TR-97-07, Microsoft Research, Redmond, WA (1997)"},{"issue":"1","key":"79_CR8","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 162(1), 439\u2013485 (2005)","journal-title":"Ann. Math."},{"issue":"1","key":"79_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J He","year":"2004","unstructured":"He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Nat. Comput. 3(1), 21\u201335 (2004)","journal-title":"Nat. Comput."},{"key":"79_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4844-2","volume-title":"Linear Programming","author":"H Karloff","year":"1991","unstructured":"Karloff, H.: Linear Programming. Birkhauser, Boston (1991)"},{"key":"79_CR11","series-title":"Complexity of Computer Computations","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"The IBM Research Symposia Series","author":"R Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J., Bohlinger, J. (eds.) The IBM Research Symposia Series. Complexity of Computer Computations, pp. 85\u2013103. Springer, US (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"79_CR12","volume-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","author":"P Larraanaga","year":"2001","unstructured":"Larraanaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Norwell (2001)"},{"issue":"2","key":"79_CR13","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"79_CR14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719802","volume-title":"Topics in intersection graph theory","author":"T Mckee","year":"1999","unstructured":"Mckee, T., Mcmorris, F.: Topics in intersection graph theory. SIAM, Philadelphia (1999)"},{"key":"79_CR15","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"GL Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter, L.E.: Vertex packings: structural properties and algorithms. Math. Progam. 8, 232\u2013248 (1975)","journal-title":"Math. Progam."},{"key":"79_CR16","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C Papadimitriou","year":"1991","unstructured":"Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43, 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"79_CR17","unstructured":"Rosin, C.D.: Unweighted stochastic local search can be effective for random CSP benchmarks. CoRR abs\/1411.7480 (2014)"},{"issue":"2","key":"79_CR18","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TEVC.2004.840835","volume":"9","author":"Q Zhang","year":"2005","unstructured":"Zhang, Q., Sun, J., Tsang, E.: An evolutionary algorithm with guided mutation for the maximum clique problem. Trans. Evol. Comp 9(2), 192\u2013200 (2005)","journal-title":"Trans. Evol. Comp"}],"container-title":["Communications in Computer and Information Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36808-1_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:28:58Z","timestamp":1710250138000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-36808-1_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030368074","9783030368081"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36808-1_79","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ajiips.com.au\/iconip2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}