{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T01:44:23Z","timestamp":1774921463839,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031629211","type":"print"},{"value":"9783031629228","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-62922-8_18","type":"book-chapter","created":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T13:02:58Z","timestamp":1718629378000},"page":"264-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fixed Set Search Matheuristic Applied to\u00a0the\u00a0min-Knapsack Problem with\u00a0Compactness Constraints and\u00a0Penalty Values"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1031-659X","authenticated-orcid":false,"given":"Ahmet","family":"C\u00fcrebal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8167-1516","authenticated-orcid":false,"given":"Raka","family":"Jovanovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,18]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.ejor.2004.06.023","volume":"170","author":"U Akinc","year":"2006","unstructured":"Akinc, U. (2006). Approximate and exact algorithms for the fixed-charge knapsack problem. European Journal of Operational Research, 170(2), 363\u2013375","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10288-022-00510-8","volume":"20","author":"MA Boschetti","year":"2022","unstructured":"Boschetti, M.A. and Maniezzo, V. (2022). Matheuristics: using mathematics for heuristic design. Journal, 20(2):173\u2013208","journal-title":"4OR"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Cacchiani, V., Iori, M., Locatelli, A., Martello, S.: Knapsack problems - an overview of recent advances. Part I: single knapsack problems. Comput. Oper. Res. 143, 105692 (2022a)","DOI":"10.1016\/j.cor.2021.105692"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Cacchiani, V., Iori, M., Locatelli, A., Martello, S.: Knapsack problems - an overview of recent advances. Part II: multiple, multidimensional, and quadratic knapsack problems. Comput. Oper. Res. 143, 105693 (2022b)","DOI":"10.1016\/j.cor.2021.105693"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s00500-021-06331-x","volume":"26","author":"G Capobianco","year":"2022","unstructured":"Capobianco, G., D\u2019Ambrosio, C., Pavone, L., Raiconi, A., Vitale, G., and Sebastiano, F. (2022). A hybrid metaheuristic for the knapsack problem with forfeits. Soft Computing, 26:749\u2013762","journal-title":"Soft. Comput."},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-030-53262-8_22","volume-title":"Combinatorial Optimization","author":"R Cerulli","year":"2020","unstructured":"Cerulli, R., D\u2019Ambrosio, C., Raiconi, A., and Vitale, G. (2020). The knapsack problem with forfeits. In Combinatorial Optimization: 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4\u20136, 2020, Revised Selected Papers 6, pages 263\u2013272. Springer"},{"issue":"4","key":"18_CR7","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.orl.2005.06.001","volume":"34","author":"A Ceselli","year":"2006","unstructured":"Ceselli, A. and Righini, G. (2006). An optimization algorithm for a penalized knapsack problem. Operations Research Letters, 34(4), 394\u2013404","journal-title":"Oper. Res. Lett."},{"issue":"1\u20132","key":"18_CR8","first-page":"15","volume":"10","author":"J Csirik","year":"1991","unstructured":"Csirik, J., Frenk, J. B. G., Labb\u00e9, M., and Zhang, S. (1991). Heuristics for the 0\u20131 min-knapsack problem. Acta Cybernetica, 10(1\u20132), 15\u201320","journal-title":"Acta Cybernet."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"C\u00fcrebal, A.: Matheuristic fixed set search for the min-knapsack problem with compactness constraints and penalty values (2024). https:\/\/github.com\/ahmet-cuerebal\/MFSS_mKPCP","DOI":"10.1007\/978-3-031-62922-8_18"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.dam.2017.11.023","volume":"253","author":"F Della Croce","year":"2019","unstructured":"Della Croce, F., Pferschy, U., and Scatamacchia, R. (2019). New exact approaches and approximation results for the penalized knapsack problem. Discrete Applied Mathematics, 253:122\u2013135","journal-title":"Discret. Appl. Math."},{"key":"18_CR11","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. Computers & Operations Research 151, 106093 (2023)","journal-title":"Comput. Oper. Res."},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T. A. and Resende, M. G. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109\u2013133","journal-title":"J. Global Optim."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-031-44505-7_27","volume-title":"Learning and Intelligent Optimization","author":"R Jovanovic","year":"2023","unstructured":"Jovanovic, R., Bayhan, S., Vo\u00df, S.: Matheuristic fixed set search applied to electric bus fleet scheduling. In: Sellmann, M., Tierney, K. (eds) Learning and Intelligent Optimization, pages 393\u2013407. Springer, Cham (2023a)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ejor.2023.01.044","volume":"309","author":"R Jovanovic","year":"2023","unstructured":"Jovanovic, R., Sanfilippo, A., Vo\u00df, S.: Fixed set search applied to the clique partitioning problem. Eur. J. Oper. Res. 309, 65\u201381 (2023)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-05983-5_5","volume-title":"Hybrid Metaheuristics","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic, R., Tuba, M., and Vo\u00df, S. (2019). Fixed set search applied to the traveling salesman problem. In Hybrid Metaheuristics: 11th International Workshop, HM 2019, Concepci\u00f3n, Chile, pages 63\u201377. Springer"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-030-34029-2_31","volume-title":"Analysis of Experimental Algorithms","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic, R. and Vo\u00df, S. (2019). Fixed set search applied to the minimum weighted vertex cover problem. In Analysis of Experimental Algorithms: Special Event, SEA$$^2$$ 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers, pages 490\u2013504. Springer"},{"issue":"6","key":"18_CR17","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12559","volume":"37","author":"R Jovanovic","year":"2020","unstructured":"Jovanovic, R. and Vo\u00df, S. (2020). The fixed set search applied to the power dominating set problem. Expert Systems, 37(6):e12559","journal-title":"Expert. Syst."},{"key":"18_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107521","volume":"110","author":"R Jovanovic","year":"2021","unstructured":"Jovanovic, R. and Vo\u00df, S. (2021). Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times. Applied Soft Computing, 110:107521","journal-title":"Appl. Soft Comput."},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Jovanovic, R., Vo\u00df, S.: Fixed set search matheuristic applied to the knapsack problem with forfeits. Comput. Oper. Res. 168, 106685 (2024)","DOI":"10.1016\/j.cor.2024.106685"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-031-26504-4_37","volume-title":"Metaheuristics","author":"I Lozano-Osorio","year":"2022","unstructured":"Lozano-Osorio, I., S\u00e1nchez-Oro, J., Mart\u00ednez-Gavara, A., L\u00f3pez-S\u00e1nchez, A.D., Duarte, A.: An efficient fixed set search for the covering location with interconnected facilities problem. In: Di Gaspero, L., Festa, P., Nakib, A., Pavone, M. (eds.) MIC 2022. LNCS, vol. 13838, pp. 485\u2013490. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-26504-4_37"},{"issue":"11","key":"18_CR21","first-page":"1","volume":"12","author":"E Madhukar","year":"2021","unstructured":"Madhukar, E. and Ragunathan, T. (2021). Improved GRASP technique based resource allocation in the cloud. International Journal of Advanced Computer Science and Applications, 12(11), 1\u20138","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"key":"18_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105848","volume":"145","author":"M Monaci","year":"2022","unstructured":"Monaci, M., Pike-Burke, C., Santini, A.: Exact algorithms for the 0\u20131 time-bomb knapsack problem. Comput. Oper. Res. 145, 105848 (2022)","journal-title":"Comput. Oper. Res."},{"key":"18_CR23","unstructured":"Santini, A.: Algorithms for the min-knapsack problem with compactness constraints. Github repository (2022)"},{"issue":"1","key":"18_CR24","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.ejor.2023.07.020","volume":"312","author":"A Santini","year":"2024","unstructured":"Santini, A. and Malaguti, E. (2024). The min-knapsack problem with compactness constraints and applications in statistics. European Journal of Operational Research, 312(1), 385\u2013397","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"18_CR25","first-page":"551","volume":"35","author":"M Sniedovich","year":"2006","unstructured":"Sniedovich, M., Vo\u00df, S.: The corridor method: A dynamic programming inspired metaheuristic. Cybernetics 35(3), 551\u2013578 (2006)","journal-title":"Cybernetics"},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-1-4615-5775-3_21","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"L Sondergeld","year":"1999","unstructured":"Sondergeld, L., Vo\u00df, S.: Cooperative intelligent search using adaptive memory techniques. In: Vo\u00df, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 297\u2013312. Kluwer, Boston, MA (1999)"},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and Surveys in Metaheuristics","author":"ED Taillard","year":"2002","unstructured":"Taillard, E.D., Vo\u00df, S.: POPMUSIC - partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, vol. 15, pp. 613\u2013629. Kluwer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4615-1507-4_27"},{"key":"18_CR28","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1090\/dimacs\/040\/20","volume":"40","author":"S Vo\u00df","year":"1997","unstructured":"Vo\u00df, S., Gutenschwager, K.: A chunking based genetic algorithm for the Steiner tree problem in graphs. Network Design: Connectivity and Facilities Location 40, 335\u2013355 (1997)","journal-title":"Netw. Des. Connect. Facil. Locat."},{"issue":"2\u20133","key":"18_CR29","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0377-2217(97)00293-2","volume":"106","author":"DL Woodruff","year":"1998","unstructured":"Woodruff, D. L. (1998). Proposals for chunking and tabu search. European Journal of Operational Research, 106(2\u20133), 585\u2013598","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"18_CR30","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1016\/j.ejor.2007.10.024","volume":"192","author":"T Yamada","year":"2009","unstructured":"Yamada, T. and Takeoka, T. (2009). An exact algorithm for the fixed-charge multiple knapsack problem. European Journal of Operational Research, 192(2), 700\u2013705","journal-title":"Eur. J. Oper. Res."}],"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-62922-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:42:54Z","timestamp":1732236174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62922-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031629211","9783031629228"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62922-8_18","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":"18 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"}}]}}