{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:35:18Z","timestamp":1726065318929},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030386283"},{"type":"electronic","value":"9783030386290"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-38629-0_1","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T14:05:05Z","timestamp":1579615505000},"page":"1-16","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Hybrid Immunological Search for the Weighted Feedback Vertex Set Problem"],"prefix":"10.1007","author":[{"given":"Vincenco","family":"Cutello","sequence":"first","affiliation":[]},{"given":"Maria","family":"Oliva","sequence":"additional","affiliation":[]},{"given":"Mario","family":"Pavone","sequence":"additional","affiliation":[]},{"given":"Rocco A.","family":"Scollo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0166-218X(99)00180-8","volume":"101","author":"L Brunetta","year":"2000","unstructured":"Brunetta, L., Maffioli, F., Trubian, M.: Solving the feedback vertex set problem on undirected graphs. Discret. Appl. Math. 101, 37\u201351 (2000)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1002\/net.21577","volume":"64","author":"F Carrabs","year":"2014","unstructured":"Carrabs, F., Cerrone, C., Cerulli, R.: A memetic algorithm for the weighted feedback vertex set problem. Networks 64(4), 339\u2013356 (2014)","journal-title":"Networks"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-642-21527-8_66","volume-title":"Network Optimization","author":"F Carrabs","year":"2011","unstructured":"Carrabs, F., Cerulli, R., Gentili, M., Parlato, G.: A tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem. In: Pahl, J., Reiners, T., Vo\u00df, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 589\u2013602. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-21527-8_66"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Conca, P., Stracquadanio, G., Greco, O., Cutello, V., Pavone, M., Nicosia, G.: Packing equal disks in a unit square: an immunological optimization approach. In: Proceedings of the International Workshop on Artificial Immune Systems (AIS), pp. 1\u20135. IEEE Press (2015)","DOI":"10.1109\/AISW.2015.7469239"},{"key":"1_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10878-006-9036-2","volume":"14","author":"V Cutello","year":"2007","unstructured":"Cutello, V., Nicosia, G., Pavone, M.: An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem. J. Comb. Optim. 14(1), 9\u201333 (2007)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TEVC.2006.880328","volume":"11","author":"V Cutello","year":"2007","unstructured":"Cutello, V., Nicosia, G., Pavone, M., Timmis, J.: An immune algorithm for protein structure prediction on lattice models. IEEE Trans. Evol. Comput. 11(1), 101\u2013117 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1980","DOI":"10.1093\/nar\/gkq1052","volume":"39","author":"V Cutello","year":"2011","unstructured":"Cutello, V., Nicosia, G., Pavone, M., Prizzi, I.: Protein multiple sequence alignment by hybrid bio-inspired algorithms. Nucl. Acids Res., Oxf. J. 39(6), 1980\u20131992 (2011)","journal-title":"Nucl. Acids Res., Oxf. J."},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/A:1009647225748","volume":"5","author":"M Dell\u2019amico","year":"1999","unstructured":"Dell\u2019amico, M., Lodi, A., Maffioli, F.: Solution of the cumulative assignment problem with a well-structured tabu search method. J. Heuristics 5(2), 123\u2013143 (1999)","journal-title":"J. Heuristics"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Di Stefano, A., Vitale, A., Cutello, V., Pavone, M.: How long should offspring lifespan be in order to obtain a proper exploration? In: Proceedings of the IEEE Symposium Series on Computational Intelligence (IEEE SSCI), pp. 1\u20138. IEEE Press (2016)","DOI":"10.1109\/SSCI.2016.7850270"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.engappai.2016.08.014","volume":"62","author":"S Fouladvand","year":"2016","unstructured":"Fouladvand, S., Osareh, A., Shadgar, B., Pavone, M., Sharafia, S.: DENSA: an effective negative selection algorithm with flexible boundaries for selfspace and dynamic number of detectors. Eng. Appl. Artif. Intell. 62, 359\u2013372 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"1_CR12","volume-title":"Computers and Intractability: A Guide to Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1137\/0217034","volume":"17","author":"D Gusfield","year":"1988","unstructured":"Gusfield, D.: A graph theoretic approach to statistical data security. SIAM J. Comput. 17(3), 552\u2013571 (1988)","journal-title":"SIAM J. Comput."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-33757-4_9","volume-title":"Artificial Immune Systems","author":"T Jansen","year":"2012","unstructured":"Jansen, T., Zarges, C.: Computing longest common subsequences with the B-cell algorithm. In: Coello Coello, C.A., Greensmith, J., Krasnogor, N., Li\u00f2, P., Nicosia, G., Pavone, M. (eds.) ICARIS 2012. LNCS, vol. 7597, pp. 111\u2013124. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-33757-4_9"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-22371-6_13","volume-title":"Artificial Immune Systems","author":"T Jansen","year":"2011","unstructured":"Jansen, T., Oliveto, P.S., Zarges, C.: On the analysis of the immune-inspired B-cell algorithm for the vertex cover problem. In: Li\u00f2, P., Nicosia, G., Stibor, T. (eds.) ICARIS 2011. LNCS, vol. 6825, pp. 117\u2013131. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-22371-6_13"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4, 77\u201384 (1975)","journal-title":"SIAM J. Comput."},{"key":"1_CR17","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Heidelberg (1972). \nhttps:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s10898-011-9736-8","volume":"53","author":"M Pavone","year":"2012","unstructured":"Pavone, M., Narzisi, G., Nicosia, G.: Clonal selection - an immunological algorithm for global optimization over continuous spaces. J. Glob. Optim. 53(4), 769\u2013808 (2012)","journal-title":"J. Glob. Optim."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0166-218X(98)00043-2","volume":"86","author":"D Peleg","year":"1998","unstructured":"Peleg, D.: Size bounds for dynamic monopolies. Discret. Appl. Math. 86, 263\u2013273 (1998)","journal-title":"Discret. Appl. Math."},{"issue":"8","key":"1_CR20","doi-asserted-by":"publisher","first-page":"e0157994","DOI":"10.1371\/journal.pone.0157994","volume":"11","author":"Y Tian","year":"2016","unstructured":"Tian, Y., Zhang, H.: Research on B cell algorithm for learning to rank method based on parallel strategy. PLoS ONE 11(8), e0157994 (2016)","journal-title":"PLoS ONE"},{"key":"1_CR21","first-page":"16","volume-title":"Advances in Intelligent Systems and Computing","author":"Alessandro Vitale","year":"2018","unstructured":"Vitale, A., Di Stefano, A., Cutello, V., Pavone, M.: The influence of age assignments on the performance of immune algorithms. In: Proceedings of the 18th Annual UK Workshop on Computational Intelligence (UKCI), Advances in Computational Intelligence Systems. Advances in Intelligent Systems and Computing series, vol. 840, pp. 16\u201328 (2018)"},{"issue":"2","key":"1_CR22","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1145\/3149.3159","volume":"32","author":"CC Wang","year":"1985","unstructured":"Wang, C.C., Lloyd, E.L., Soffa, M.L.: Feedback vertex set and cyclically reducible graphs. J. Assoc. Comput. Mach. (ACM) 32(2), 296\u2013313 (1985)","journal-title":"J. Assoc. Comput. Mach. (ACM)"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ins.2017.10.038","volume":"426","author":"X Xia","year":"2018","unstructured":"Xia, X., Yuren, Z.: On the effectiveness of immune inspired mutation operators in some discrete optimization problems. Inf. Sci. 426, 87\u2013100 (2018)","journal-title":"Inf. Sci."},{"issue":"2","key":"1_CR24","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Node-deletion problem on bipartite graphs. SIAM J. Comput. 10(2), 310\u2013327 (1981)","journal-title":"SIAM J. Comput."},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Zarges, C.: On the utility of the population size for inversely fitness proportional mutation rates. In: Proceedings of the $$10th$$ ACM SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA), pp. 39\u201346 (2009)","DOI":"10.1145\/1527125.1527132"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38629-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T14:19:52Z","timestamp":1579616392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chania, Crete","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion13.pem.tuc.gr\/en\/home\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}