{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T15:01:11Z","timestamp":1773414071521,"version":"3.50.1"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031629112","type":"print"},{"value":"9783031629129","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-62912-9_1","type":"book-chapter","created":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:01:37Z","timestamp":1718550097000},"page":"3-8","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Breakout Local Search for\u00a0Heaviest Subgraph Problem"],"prefix":"10.1007","author":[{"given":"He","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"issue":"9","key":"1_CR1","doi-asserted-by":"publisher","first-page":"4800","DOI":"10.1016\/j.amc.2012.10.106","volume":"219","author":"U Benlic","year":"2013","unstructured":"Benlic, U., Hao, J.K.: Breakout local search for the quadratic assignment problem. Appl. Math. Comput. 219(9), 4800\u20134815 (2013)","journal-title":"Appl. Math. Comput."},{"key":"1_CR2","unstructured":"Benlic, U., Hao, J.K.: Breakout local search for the vertex separator problem. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, pp. 461\u2013467. AAAI Press (2013)"},{"issue":"11","key":"1_CR3","doi-asserted-by":"publisher","first-page":"2885","DOI":"10.1016\/j.cor.2008.12.020","volume":"36","author":"J Brimberg","year":"2009","unstructured":"Brimberg, J., Mladenovi\u0107, N., Uro\u0161evi\u0107, D., Ngai, E.: Variable neighborhood search for the heaviest k-subgraph. Comput. Oper. Res. 36(11), 2885\u20132891 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"DG Corneil","year":"1984","unstructured":"Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discret. Appl. Math. 9(1), 27\u201339 (1984)","journal-title":"Discret. Appl. Math."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Letsios, M., Balalau, O.D., Danisch, M., Orsini, E., Sozio, M.: Finding heaviest k-subgraphs and events in social media. In: 2016 IEEE 16th International Conference on Data Mining Workshops, pp. 113\u2013120. IEEE (2016)","DOI":"10.1109\/ICDMW.2016.0024"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1021525624027","volume":"117","author":"EM Macambira","year":"2002","unstructured":"Macambira, E.M.: An application of tabu search heuristic for the maximum edge-weighted subgraph problem. Ann. Oper. Res. 117, 175\u2013190 (2002)","journal-title":"Ann. Oper. Res."},{"key":"1_CR7","unstructured":"Saarinen, V.P., Chen, T.H.Y., Kivel\u00e4, M.: OVNS: opportunistic variable neighborhood search for heaviest subgraph problem in social networks. arXiv preprint arXiv:2305.19729 (2023)"}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62912-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:10:14Z","timestamp":1718550614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62912-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031629112","9783031629129"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62912-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lorient","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mic2024.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}