{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T08:10:19Z","timestamp":1783930219517,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819234318","type":"print"},{"value":"9789819234325","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T00:00:00Z","timestamp":1783987200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T00:00:00Z","timestamp":1783987200000},"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":[[2027]]},"DOI":"10.1007\/978-981-92-3432-5_15","type":"book-chapter","created":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T07:40:07Z","timestamp":1783928407000},"page":"177-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Solution-Based Tabu Search for Quadratic Knapsack Problem with Conflict Graphs"],"prefix":"10.1007","author":[{"given":"Qihao","family":"Song","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenghao","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xueshi","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,14]]},"reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3570618","volume":"6","author":"B Sun","year":"2022","unstructured":"Sun, B., et al.: The online knapsack problem with departures. Proc. ACM Meas. Anal. Comput. Syst. 6(3), 1\u201332 (2022)","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.matcom.2023.12.033","volume":"219","author":"Y He","year":"2024","unstructured":"He, Y., Wang, J., Liu, X., Wang, X., Ouyang, H.: Modeling and solving of knapsack problem with setup based on evolutionary algorithm. Math. Comput. Simul 219, 378\u2013403 (2024)","journal-title":"Math. Comput. Simul"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.future.2021.07.033","volume":"126","author":"Y Feng","year":"2022","unstructured":"Feng, Y., Wang, G.G.: A binary moth search algorithm based on self-learning for multidimensional knapsack problems. Future Gener. Comput. Syst. 126, 48\u201364 (2022)","journal-title":"Future Gener. Comput. Syst."},{"issue":"18","key":"15_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.3991\/ijet.v17i18.32363","volume":"17","author":"G Shruthi","year":"2022","unstructured":"Shruthi, G., Mundada, M., Supreeth, S.: The resource allocation using weighted greedy knapsack based algorithm in an educational fog computing environment. Int. J. Emerg. Technol. Learn. (iJET) 17(18), 261\u2013274 (2022)","journal-title":"Int. J. Emerg. Technol. Learn. (iJET)"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.ijpe.2011.12.011","volume":"141","author":"F Aisopos","year":"2013","unstructured":"Aisopos, F., Tserpes, K., Varvarigou, T.: Resource management in software as a service using the knapsack problem model. Int. J. Prod. Econ. 141(2), 465\u2013477 (2013)","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1016\/j.ejor.2021.04.001","volume":"296","author":"Q Zhou","year":"2022","unstructured":"Zhou, Q., Hao, J.K., Wu, Q.: A hybrid evolutionary search for the generalized quadratic multiple knapsack problem. Eur. J. Oper. Res. 296(3), 788\u2013803 (2022)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ejor.2021.11.004","volume":"301","author":"G Beliakov","year":"2022","unstructured":"Beliakov, G.: Knapsack problems with dependencies through non-additive mea-sures and Choquet integral. Eur. J. Oper. Res. 301(1), 277\u2013286 (2022)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ejor.2021.06.018","volume":"298","author":"K Fleszar","year":"2022","unstructured":"Fleszar, K.: A branch-and-bound algorithm for the quadratic multiple knapsack problem. Eur. J. Oper. Res. 298(1), 89\u201398 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"15_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106093","volume":"151","author":"C D\u2019Ambrosio","year":"2023","unstructured":"D\u2019Ambrosio, C., Laureana, F., Raiconi, A., Vitale, G.: The Knapsack problem with forfeit sets. Comput. Oper. Res. 151, 106093 (2023)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"236","DOI":"10.3390\/su9020236","volume":"9","author":"X Shi","year":"2017","unstructured":"Shi, X., Wu, L., Meng, X.: A new optimization model for the sustainable development: quadratic knapsack problem with conflict graphs. Sustainability 9(2), 236 (2017)","journal-title":"Sustainability"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10479-019-03290-3","volume":"298","author":"I Dahmani","year":"2021","unstructured":"Dahmani, I., Hifi, M.: A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs. Ann. Oper. Res. 298, 125\u2013147 (2021)","journal-title":"Ann. Oper. Res."},{"key":"15_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.119856","volume":"223","author":"Z Lu","year":"2023","unstructured":"Lu, Z., Mart\u00ednez Gavara, A., Hao, J.K., Lai, X.: Solution-based tabu search for the capacitated dispersion problem. Expert Syst. Appl. 223, 119856 (2023)","journal-title":"Expert Syst. Appl."},{"key":"15_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113224","volume":"148","author":"I Dahmani","year":"2020","unstructured":"Dahmani, I., Hifi, M., Saadi, T., Yousef, L.: A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict graphs. Expert Syst. Appl. 148, 113224 (2020)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garc\u00eda, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1(1), 3\u201318 (2011)","journal-title":"Swarm Evol. Comput."},{"key":"15_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107260","volume":"105","author":"Z Wei","year":"2021","unstructured":"Wei, Z., Hao, J.K.: Multistart solution-based tabu search for the Set-Union Knap-sack problem. Appl. Soft Comput. 105, 107260 (2021)","journal-title":"Appl. Soft Comput."},{"key":"15_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116238","volume":"191","author":"M A\u00efder","year":"2022","unstructured":"A\u00efder, M., Gacem, O., Hifi, M.: A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem. Expert Syst. Appl. 191, 116238 (2022)","journal-title":"Expert Syst. Appl."},{"key":"15_CR17","unstructured":"Zhou, Q., Hao, J. K., Jiang, Z. Z., Wu, Q.: An effective hybrid search method for the quadratic knapsack problem with conflict graphs. J. Oper. Res. Soc., 1\u201311 (2023)"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-3432-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T07:40:08Z","timestamp":1783928408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-3432-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,14]]},"ISBN":["9789819234318","9789819234325"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-3432-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,14]]},"assertion":[{"value":"14 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2026a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2026\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}