{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T22:48:18Z","timestamp":1790117298564,"version":"4.0.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T00:00:00Z","timestamp":1707696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T00:00:00Z","timestamp":1707696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100019687","name":"Hamad bin Khalifa University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100019687","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, we present a solution method for the multidimensional knapsack problem (MKP) and the knapsack problem with forfeit sets (KPFS) using a population-based matheuristic approach. Specifically, the learning mechanism of the fixed set search (FSS) metaheuristic is combined with the use of integer programming for solving subproblems. This is achieved by introducing a new ground set of elements that can be used for both the MKP and the KPFS that aim to maximize the information provided by the fixed set. The method for creating fixed sets is also adjusted to enhance the diversity of generated solutions. Compared to state-of-the-art methods for the MKP and the KPFS, the proposed approach offers an implementation that can be easily extended to other variants of the knapsack problem. Computational experiments indicate that the matheuristic FSS is highly competitive to best-performing methods from the literature. The proposed approach is robust in the sense of having a good performance for a wide range of parameter values of the method.<\/jats:p>","DOI":"10.1007\/s00291-024-00746-2","type":"journal-article","created":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T12:02:22Z","timestamp":1707739342000},"page":"1329-1365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8167-1516","authenticated-orcid":false,"given":"Raka","family":"Jovanovic","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,2,12]]},"reference":[{"issue":"2","key":"746_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.cor.2009.04.015","volume":"37","author":"S Al-Shihabi","year":"2010","unstructured":"Al-Shihabi S, \u00d3lafsson S (2010) A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem. Comput Oper Res 37(2):247\u2013255","journal-title":"Comput Oper Res"},{"issue":"11","key":"746_CR2","doi-asserted-by":"publisher","first-page":"2017","DOI":"10.1016\/j.cor.2010.02.002","volume":"37","author":"E Angelelli","year":"2010","unstructured":"Angelelli E, Mansini R, Speranza MG (2010) Kernel search: a general heuristic for the multi-dimensional knapsack problem. Comput Oper Res 37(11):2017\u20132026","journal-title":"Comput Oper Res"},{"key":"746_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.asoc.2016.05.016","volume":"46","author":"A Arin","year":"2016","unstructured":"Arin A, Rabadi G (2016) Local search versus path relinking in metaheuristics: redesigning Meta-RaPS with application to the multidimensional knapsack problem. Appl Soft Comput 46:317\u2013327","journal-title":"Appl Soft Comput"},{"issue":"4","key":"746_CR4","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1504\/IJOR.2018.093509","volume":"32","author":"C Basnet","year":"2018","unstructured":"Basnet C (2018) Heuristics for the multiple knapsack problem with conflicts. Int J Oper Res 32(4):514\u2013525","journal-title":"Int J Oper Res"},{"issue":"2","key":"746_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10288-022-00510-8","volume":"20","author":"MA Boschetti","year":"2022","unstructured":"Boschetti MA, Maniezzo V (2022) Matheuristics: using mathematics for heuristic design. 4OR 20(2):173\u2013208","journal-title":"4OR"},{"issue":"2","key":"746_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.dam.2009.08.007","volume":"158","author":"S Boussier","year":"2010","unstructured":"Boussier S, Vasquez M, Vimont Y, Hanafi S, Michelon P (2010) A multi-level search strategy for the 0\u20131 multidimensional knapsack problem. Discret Appl Math 158(2):97\u2013109","journal-title":"Discret Appl Math"},{"key":"746_CR7","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, Sebastiano F (2022) A hybrid metaheuristic for the knapsack problem with forfeits. Soft Comput 26:749\u2013762","journal-title":"Soft Comput"},{"key":"746_CR8","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.omega.2018.06.014","volume":"86","author":"M Caserta","year":"2019","unstructured":"Caserta M, Vo\u00df S (2019) The robust multiple-choice multidimensional knapsack problem. Omega 86:16\u201327. https:\/\/doi.org\/10.1016\/j.omega.2018.06.014","journal-title":"Omega"},{"issue":"2","key":"746_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.ejor.2014.05.025","volume":"239","author":"Y Chen","year":"2014","unstructured":"Chen Y, Hao JK (2014) A \u201creduce and solve\u2019\u2019 approach for the multiple-choice multidimensional knapsack problem. Eur J Oper Res 239(2):313\u2013322. https:\/\/doi.org\/10.1016\/j.ejor.2014.05.025","journal-title":"Eur J Oper Res"},{"key":"746_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu PC, Beasley JE (1998) A genetic algorithm for the multidimensional knapsack problem. J Heuristics 4:63\u201386","journal-title":"J Heuristics"},{"issue":"2","key":"746_CR11","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ejor.2020.07.023","volume":"289","author":"S Coniglio","year":"2021","unstructured":"Coniglio S, Furini F, San Segundo P (2021) A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts. Eur J Oper Res 289(2):435\u2013455","journal-title":"Eur J Oper Res"},{"key":"746_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02022561","volume":"41","author":"F Dammeyer","year":"1993","unstructured":"Dammeyer F, Vo\u00df S (1993) Dynamic tabu list management using the reverse elimination method. Ann Oper Res 41:29\u201346. https:\/\/doi.org\/10.1007\/BF02022561","journal-title":"Ann Oper Res"},{"issue":"1","key":"746_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02242185","volume":"40","author":"A Drexl","year":"1988","unstructured":"Drexl A (1988) A simulated annealing approach to the multiconstraint zero-one knapsack problem. Computing 40(1):1\u20138","journal-title":"Computing"},{"issue":"106","key":"746_CR14","first-page":"093","volume":"151","author":"C D\u2019Ambrosio","year":"2023","unstructured":"D\u2019Ambrosio C, Laureana F, Raiconi A, Vitale G (2023) The knapsack problem with forfeit sets. Comput Oper Res 151(106):093","journal-title":"Comput Oper Res"},{"issue":"2","key":"746_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MG (1995) Greedy randomized adaptive search procedures. J Global Optim 6(2):109\u2013133","journal-title":"J Global Optim"},{"issue":"1","key":"746_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A Fr\u00e9ville","year":"2004","unstructured":"Fr\u00e9ville A (2004) The multidimensional 0\u20131 knapsack problem: an overview. Eur J Oper Res 155(1):1\u201321. https:\/\/doi.org\/10.1016\/S0377-2217(03)00274-1","journal-title":"Eur J Oper Res"},{"key":"746_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.dam.2022.06.033","volume":"335","author":"L Galli","year":"2023","unstructured":"Galli L, Martello S, Rey C, Toth P (2023) Lagrangian matheuristics for the quadratic multiple knapsack problem. Discret Appl Math 335:36\u201351","journal-title":"Discret Appl Math"},{"key":"746_CR18","doi-asserted-by":"publisher","first-page":"1951","DOI":"10.1007\/s13042-020-01085-8","volume":"11","author":"J Garc\u00eda","year":"2020","unstructured":"Garc\u00eda J, Lalla-Ruiz E, Vo\u00df S, Droguett E (2020) Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem. Int J Mach Learn Cybern 11:1951\u20131970. https:\/\/doi.org\/10.1007\/s13042-020-01085-8","journal-title":"Int J Mach Learn Cybern"},{"key":"746_CR19","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York"},{"issue":"6","key":"746_CR20","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"P Gilmore","year":"1966","unstructured":"Gilmore P, Gomory RE (1966) The theory and computation of knapsack functions. Oper Res 14(6):1045\u20131074","journal-title":"Oper Res"},{"key":"746_CR21","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-1-4613-1361-8_25","volume-title":"Meta-heuristics: theory and applications","author":"F Glover","year":"1996","unstructured":"Glover F, Kochenberger GA (1996) Critical event tabu search for multidimensional knapsack problems. In: Osman IH, Kelly JP (eds) Meta-heuristics: theory and applications. Kluwer, Boston, pp 407\u2013427. https:\/\/doi.org\/10.1007\/978-1-4613-1361-8_25"},{"key":"746_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2016.05.006","volume":"55","author":"B Haddar","year":"2016","unstructured":"Haddar B, Khemakhem M, Hanafi S, Wilbaut C (2016) A hybrid quantum particle swarm optimization for the multidimensional knapsack problem. Eng Appl Artif Intell 55:1\u201313","journal-title":"Eng Appl Artif Intell"},{"issue":"2\u20133","key":"746_CR23","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1016\/S0377-2217(97)00296-8","volume":"106","author":"S Hanafi","year":"1998","unstructured":"Hanafi S, Freville A (1998) An efficient tabu search approach for the 0\u20131 multidimensional knapsack problem. Eur J Oper Res 106(2\u20133):659\u2013675","journal-title":"Eur J Oper Res"},{"key":"746_CR24","doi-asserted-by":"crossref","unstructured":"Jovanovic R, Vo\u00df S (2019) Fixed set search applied to the minimum weighted vertex cover problem. In: International symposium on experimental algorithms. Springer, pp 490\u2013504","DOI":"10.1007\/978-3-030-34029-2_31"},{"issue":"6","key":"746_CR25","doi-asserted-by":"publisher","first-page":"e12559","DOI":"10.1111\/exsy.12559","volume":"37","author":"R Jovanovic","year":"2020","unstructured":"Jovanovic R, Voss S (2020) The fixed set search applied to the power dominating set problem. Expert Syst 37(6):e12559","journal-title":"Expert Syst"},{"issue":"107","key":"746_CR26","first-page":"521","volume":"110","author":"R Jovanovic","year":"2021","unstructured":"Jovanovic R, Vo\u00df S (2021) Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times. Appl Soft Comput 110(107):521","journal-title":"Appl Soft Comput"},{"key":"746_CR27","doi-asserted-by":"crossref","unstructured":"Jovanovic R, Tuba M, Vo\u00df S (2019) Fixed set search applied to the traveling salesman problem. In: International workshop on hybrid metaheuristics. Springer, pp 63\u201377","DOI":"10.1007\/978-3-030-05983-5_5"},{"key":"746_CR28","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10732-022-09499-z","volume":"28","author":"R Jovanovic","year":"2022","unstructured":"Jovanovic R, Sanfilippo AP, Vo\u00df S (2022) Fixed set search applied to the multi-objective minimum weighted vertex cover problem. J Heuristics 28:481\u2013508","journal-title":"J Heuristics"},{"key":"746_CR29","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 (2023a) Matheuristic fixed set search applied to electric bus fleet scheduling. In: Sellmann M, Tierney K (eds) Learning and intelligent optimization. Springer, Cham, pp 393\u2013407"},{"issue":"1","key":"746_CR30","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 AP, Vo\u00df S (2023b) Fixed set search applied to the clique partitioning problem. Eur J Oper Res 309(1):65\u201381","journal-title":"Eur J Oper Res"},{"issue":"4","key":"746_CR31","doi-asserted-by":"publisher","first-page":"43","DOI":"10.4018\/jamc.2012100103","volume":"3","author":"M Khemakhem","year":"2012","unstructured":"Khemakhem M, Haddar B, Chebil K, Hanafi S (2012) A filter-and-fan metaheuristic for the 0\u20131 multidimensional knapsack problem. Int J Appl Metaheur Comput (IJAMC) 3(4):43\u201363","journal-title":"Int J Appl Metaheur Comput (IJAMC)"},{"key":"746_CR32","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.ins.2018.01.026","volume":"436\u2013437","author":"X Lai","year":"2018","unstructured":"Lai X, Hao JK, Glover F, L\u00fc Z (2018) A two-phase tabu-evolutionary algorithm for the 0\u20131 multidimensional knapsack problem. Inf Sci 436\u2013437:282\u2013301. https:\/\/doi.org\/10.1016\/j.ins.2018.01.026","journal-title":"Inf Sci"},{"issue":"1","key":"746_CR33","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ejor.2018.10.001","volume":"274","author":"X Lai","year":"2019","unstructured":"Lai X, Hao JK, Yue D (2019) Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem. Eur J Oper Res 274(1):35\u201348. https:\/\/doi.org\/10.1016\/j.ejor.2018.10.001","journal-title":"Eur J Oper Res"},{"issue":"113","key":"746_CR34","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.eswa.2020.113310","volume":"149","author":"X Lai","year":"2020","unstructured":"Lai X, Hao JK, Fu ZH, Yue D (2020) Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem. Expert Syst Appl 149(113):310. https:\/\/doi.org\/10.1016\/j.eswa.2020.113310","journal-title":"Expert Syst Appl"},{"issue":"06","key":"746_CR35","doi-asserted-by":"publisher","first-page":"2150010","DOI":"10.1142\/S021759592150010X","volume":"38","author":"J Li","year":"2021","unstructured":"Li J, Lan Y, Chen F, Han X, Blazewicz J (2021) A fast algorithm for knapsack problem with conflict graph. Asia-Pacific J Oper Res 38(06):2150010","journal-title":"Asia-Pacific J Oper Res"},{"key":"746_CR36","doi-asserted-by":"crossref","unstructured":"Lozano-Osorio I, S\u00e1nchez-Oro J, Mart\u00ednez-Gavara A, L\u00f3pez-S\u00e1nchez AD, Duarte A (2023) An efficient fixed set search for the covering location with interconnected facilities problem. In: Metaheuristics: 14th international conference. Springer, pp 485\u2013490","DOI":"10.1007\/978-3-031-26504-4_37"},{"key":"746_CR37","doi-asserted-by":"crossref","unstructured":"Maniezzo V, Boschetti MA, St\u00fctzle T (2021) Kernel search. In: Matheuristics. Springer, pp 189\u2013197","DOI":"10.1007\/978-3-030-70277-9_9"},{"issue":"3","key":"746_CR38","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1016\/j.ejor.2019.07.052","volume":"289","author":"S Mancini","year":"2021","unstructured":"Mancini S, Ciavotta M, Meloni C (2021) The multiple multidimensional knapsack with family-split penalties. Eur J Oper Res 289(3):987\u2013998. https:\/\/doi.org\/10.1016\/j.ejor.2019.07.052","journal-title":"Eur J Oper Res"},{"issue":"3","key":"746_CR39","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/ijoc.1110.0460","volume":"24","author":"R Mansini","year":"2012","unstructured":"Mansini R, Speranza MG (2012) Coral: an exact algorithm for the multidimensional knapsack problem. Informs J Comput 24(3):399\u2013415","journal-title":"Informs J Comput"},{"key":"746_CR40","doi-asserted-by":"publisher","first-page":"2567","DOI":"10.1007\/s00500-017-2511-0","volume":"22","author":"LF Mingo L\u00f3pez","year":"2018","unstructured":"Mingo L\u00f3pez LF, G\u00f3mez Blas N, Arteta Albert A (2018) Multidimensional knapsack problem optimization using a binary particle swarm model with genetic operations. Soft Comput 22:2567\u20132582","journal-title":"Soft Comput"},{"key":"746_CR41","unstructured":"PassMark (2022) CPU benchmark. www.cpubenchmark.net, last visited 2022-01-30"},{"issue":"2","key":"746_CR42","doi-asserted-by":"publisher","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"U Pferschy","year":"2009","unstructured":"Pferschy U, Schauer J (2009) The knapsack problem with conflict graphs. J Graph Algorithms Appl 13(2):233\u2013249","journal-title":"J Graph Algorithms Appl"},{"key":"746_CR43","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s12293-017-0232-7","volume":"10","author":"A Rezoug","year":"2018","unstructured":"Rezoug A, Bader-El-Den M, Boughaci D (2018) Guided genetic algorithm for the multidimensional knapsack problem. Memet Comput 10:29\u201342","journal-title":"Memet Comput"},{"issue":"1","key":"746_CR44","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0377-2217(96)00100-2","volume":"97","author":"K Rosing","year":"1997","unstructured":"Rosing K, ReVelle C (1997) Heuristic concentration: two stage solution construction. Eur J Oper Res 97(1):75\u201386","journal-title":"Eur J Oper Res"},{"key":"746_CR45","doi-asserted-by":"publisher","first-page":"3361","DOI":"10.1111\/itor.13237","volume":"30","author":"M Sarhani","year":"2023","unstructured":"Sarhani M, Vo\u00df S, Jovanovic R (2023) Initialization of metaheuristics: comprehensive review, critical analysis, and research directions. Int Trans Oper Res 30:3361\u20133397. https:\/\/doi.org\/10.1111\/itor.13237","journal-title":"Int Trans Oper Res"},{"issue":"4","key":"746_CR46","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1057\/jors.1979.78","volume":"30","author":"W Shih","year":"1979","unstructured":"Shih W (1979) A branch and bound method for the multiconstraint zero-one knapsack problem. J Oper Res Soc 30(4):369\u2013378","journal-title":"J Oper Res Soc"},{"key":"746_CR47","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 (1999) Cooperative intelligent search using adaptive memory techniques. In: Vo\u00df S, Martello S, Osman I, Roucairol C (eds) Meta-heuristics: advances and trends in local search paradigms for optimization. Kluwer, Boston, pp 297\u2013312"},{"key":"746_CR48","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and surveys in metaheuristics","author":"E Taillard","year":"2002","unstructured":"Taillard E, Vo\u00df S (2002) POPMUSIC\u2014a partial optimization metaheuristic under special intensification conditions. In: Ribeiro C, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Boston, pp 613\u2013629"},{"issue":"1","key":"746_CR49","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2004.01.024","volume":"165","author":"M Vasquez","year":"2005","unstructured":"Vasquez M, Vimont Y (2005) Improved results on the 0\u20131 multidimensional knapsack problem. Eur J Oper Res 165(1):70\u201381","journal-title":"Eur J Oper Res"},{"issue":"2","key":"746_CR50","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10878-007-9074-4","volume":"15","author":"Y Vimont","year":"2008","unstructured":"Vimont Y, Boussier S, Vasquez M (2008) Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem. J Comb Optim 15(2):165\u2013178","journal-title":"J Comb Optim"},{"key":"746_CR51","first-page":"335","volume-title":"Network design: connectivity and facilities location, DIMACS series in discrete mathematics and theoretical computer science","author":"S Vo\u00df","year":"1998","unstructured":"Vo\u00df S, Gutenschwager K (1998) A chunking based genetic algorithm for the Steiner tree problem in graphs. In: Pardalos P, Du DZ (eds) Network design: connectivity and facilities location, DIMACS series in discrete mathematics and theoretical computer science, vol 40. Princeton, AMS, pp 335\u2013355"},{"key":"746_CR52","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0377-2217(97)00293-2","volume":"106","author":"D Woodruff","year":"1998","unstructured":"Woodruff D (1998) Proposals for chunking and tabu search. Eur J Oper Res 106:585\u2013598","journal-title":"Eur J Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00746-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-024-00746-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00746-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T03:15:57Z","timestamp":1729739757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-024-00746-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,12]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["746"],"URL":"https:\/\/doi.org\/10.1007\/s00291-024-00746-2","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,12]]},"assertion":[{"value":"9 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}