{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T11:39:23Z","timestamp":1768649963153,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T00:00:00Z","timestamp":1573084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T00:00:00Z","timestamp":1573084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11590-019-01503-z","type":"journal-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T12:03:21Z","timestamp":1573128201000},"page":"37-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A matheuristic for the 0\u20131 generalized quadratic multiple knapsack problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Yassine","family":"Adouani","sequence":"first","affiliation":[]},{"given":"Bassem","family":"Jarboui","sequence":"additional","affiliation":[]},{"given":"Malek","family":"Masmoudi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,7]]},"reference":[{"key":"1503_CR1","first-page":"124","volume":"32","author":"E Chajakis","year":"1994","unstructured":"Chajakis, E., Guignard, M.: Exact algorithms for the setup knapsack problem. IN-FOR. 32, 124\u2013142 (1994)","journal-title":"IN-FOR."},{"key":"1503_CR2","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.cor.2017.02.004","volume":"83","author":"M Avci","year":"2017","unstructured":"Avci, M., Topaloglu, S.: A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem. Comput. Oper. Res. 83, 54\u201365 (2017)","journal-title":"Comput. Oper. Res."},{"key":"1503_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.cor.2013.08.018","volume":"43","author":"T Sara\u00e7","year":"2014","unstructured":"Sara\u00e7, T., Sipahioglu, A.: Generalized quadratic multiple knapsack problem and two solution approaches. Comput. Oper. Res. 43, 78\u201389 (2014)","journal-title":"Comput. Oper. Res."},{"key":"1503_CR4","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D.: The quadratic knapsack problem\u2014a survey. Discret. Appl. Math. 155, 623\u201348 (2007)","journal-title":"Discret. Appl. Math."},{"key":"1503_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01585164","volume":"62","author":"E Johnson","year":"1993","unstructured":"Johnson, E., Mehrotra, A., Nemhauser, G.: Min-cut clustering. Math. Program. 62, 133\u2013152 (1993)","journal-title":"Math. Program."},{"key":"1503_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BFb0083467","volume-title":"Combinatorial Optimization","author":"P Chaillou","year":"1989","unstructured":"Chaillou, P., Hansen, P., Mahieu, Y.: Best network flow bounds for the quadratic knapsack problem. Combinatorial Optimization, pp. 225\u2013235. Springer, Berlin (1989)"},{"key":"1503_CR7","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/ijoc.1030.0029","volume":"16","author":"A Billionnet","year":"2004","unstructured":"Billionnet, A., Soutif, \u00c9.: Using a mixed integer programming tool for solving the 0\u20131 quadratic knapsack problem. INFORMS J. Comput. 16, 188\u2013197 (2004)","journal-title":"INFORMS J. Comput."},{"key":"1503_CR8","series-title":"Theory and Algorithms","first-page":"626","volume-title":"Neural Information Processing","author":"S Sundar","year":"2010","unstructured":"Sundar, S., Singh, A.: A swarm intelligence approach to the quadratic multiple knapsack problem. Neural Information Processing. Theory and Algorithms, pp. 626\u2013633. Springer, Berlin (2010)"},{"key":"1503_CR9","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.ejor.2013.07.035","volume":"232","author":"C Garc\u00eda-Mart\u00ednez","year":"2014","unstructured":"Garc\u00eda-Mart\u00ednez, C., Rodriguez, F.J., Lozano, M.: Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem. Eur. J. Oper. Res. 232, 454\u2013463 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"1503_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cor.2015.08.002","volume":"66","author":"J Qin","year":"2016","unstructured":"Qin, J., Xu, X., Wu, Q., Cheng, T.C.E.: Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem. Comput. Oper. Res. 66, 199\u2013214 (2016)","journal-title":"Comput. Oper. Res."},{"key":"1503_CR11","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.ejor.2016.02.043","volume":"253","author":"B Peng","year":"2016","unstructured":"Peng, B., Liu, M., L\u00fc, Z., Kochengber, G., Wang, H.: An ejection chain approach for the quadratic multiple knapsack problem. Eur. J. Oper. Res. 253, 328\u2013336 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"1503_CR12","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1109\/TEVC.2016.2546340","volume":"20","author":"Y Chen","year":"2016","unstructured":"Chen, Y., Hao, J.K.: Memetic search for the generalized quadratic multiple knapsack problem. IEEE Trans. Evolut. Comput. 20, 908\u2013923 (2016)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"1503_CR13","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.ejor.2007.07.035","volume":"199","author":"L Jourdan","year":"2009","unstructured":"Jourdan, L., Basseur, M., Talbi, E.G.: Hybridizing exact methods and metaheuristics. Eur. J. Oper. Res. 199, 620\u2013629 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"1503_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-36605-9_20","volume":"2611","author":"I Dumitrescu","year":"2003","unstructured":"Dumitrescu, I., Stutzle, T.: Combinations of local search and exact algorithms. Appl. Evolut. Comput. 2611, 211\u2013223 (2003)","journal-title":"Appl. Evolut. Comput."},{"key":"1503_CR15","first-page":"41","volume":"3562","author":"J Puchinger","year":"2005","unstructured":"Puchinger, J., Raidl, G.R.: Combining meta-heuristics and exact algorithms in combinatorial optimization. Artif. Intell. Knowl. Eng. Appl. 3562, 41\u201353 (2005)","journal-title":"Artif. Intell. Knowl. Eng. Appl."},{"key":"1503_CR16","doi-asserted-by":"crossref","unstructured":"Hanafi, S., Lazi\u0107, J., Mladenovi\u0107, N., Wilbaut, C.: New hybrid matheuristics for solving the multidimensional knapsack problem. In: International Workshop on Hybrid Metaheuristics, pp. 118\u2013132. vol. 6373, Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-16054-7_9"},{"key":"1503_CR17","unstructured":"Fernandes, S., Lourenco, H.: Hybrid combining local search heuristics with exact algorithms. In: Algoritmos Evolutivos y Bioinspirados, pp. 269\u2013274. Spain (2007)"},{"key":"1503_CR18","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.ejor.2009.07.036","volume":"2003","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Li, J., Qu, R.: A hybrid model of integer programming and variable neighborhood search for highly-constrained nurse rostering problems. Eur. J. Oper. Res. 2003, 484\u2013493 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"1503_CR19","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1016\/j.ejor.2007.04.044","volume":"191","author":"M Prandtstetter","year":"2008","unstructured":"Prandtstetter, M., Raidl, G.R.: An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. Eur. J. Oper. Res. 191, 1004\u20131022 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"1503_CR20","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10898-014-0185-z","volume":"63","author":"A Lamghari","year":"2015","unstructured":"Lamghari, A., Dimitrakopoulos, R., Ferland, J.A.: A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines. J. Glob. Optim. 63, 555\u2013582 (2015)","journal-title":"J. Glob. Optim."},{"key":"1503_CR21","unstructured":"Vasquez, M., Hao, J.K.: A hybrid approach for the 0\u20131 multidimensional knapsack problem. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 328-333. Washington (2001)"},{"key":"1503_CR22","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0377-2217(94)00229-0","volume":"92","author":"A Billionnet","year":"1996","unstructured":"Billionnet, A., Calmels, F.: Linear programming for the 0\u20131 quadratic knapsack problem. Eur. J. Oper. Res. 92, 310\u2013325 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"1503_CR23","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0377-2217(99)00260-X","volume":"123","author":"S Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., Toth, P.: New trends in exact algorithms for the 0\u20131 knapsack problems. Eur. J. Oper. Res. 123, 325\u2013332 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"1503_CR24","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"1503_CR25","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovic, N., Todosijevic, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5, 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"key":"1503_CR26","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cor.2012.05.009","volume":"40","author":"B Jarboui","year":"2013","unstructured":"Jarboui, B., Derbel, H., Hanafi, S., Maldenovic, N.: Variable neighborhood search for location routing. Comput. Oper. Res. 40, 47\u201357 (2013)","journal-title":"Comput. Oper. Res."},{"key":"1503_CR27","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0377-2217(78)90093-0","volume":"2","author":"AL Soyster","year":"1978","unstructured":"Soyster, A.L., Lev, B., Slivka, W.: Zero-one programming with many variables and few constraints. Eur. J. Oper. Res. 2, 195\u2013201 (1978)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01503-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-019-01503-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01503-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T11:39:05Z","timestamp":1641814745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-019-01503-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,7]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1503"],"URL":"https:\/\/doi.org\/10.1007\/s11590-019-01503-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,7]]},"assertion":[{"value":"9 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}