{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:39:04Z","timestamp":1759847944451,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160530"},{"type":"electronic","value":"9783642160547"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16054-7_9","type":"book-chapter","created":{"date-parts":[[2010,9,30]],"date-time":"2010-09-30T22:07:50Z","timestamp":1285884470000},"page":"118-132","source":"Crossref","is-referenced-by-count":7,"title":["New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Sa\u00efd","family":"Hanafi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jasmina","family":"Lazi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Wilbaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Cr\u00e9vits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Dunn, O.J.: Multiple comparisons among means. Journal of the American Statistical Association, 52\u201364 (1961)","key":"9_CR1","DOI":"10.1080\/01621459.1961.10482090"},{"key":"9_CR2","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.: A multi-level search strategy for the 0-1 Multidimensional Knapsack. Discrete Applied Mathematics\u00a0158, 97\u2013109 (2010)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P.C. Chu","year":"1998","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics\u00a04, 63\u201386 (1998)","journal-title":"Journal of Heuristics"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E. Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxations induced neighborhoods to improve MIP solutions. Mathematical Programming\u00a0102, 71\u201390 (2005)","journal-title":"Mathematical Programming"},{"key":"9_CR5","first-page":"1","volume":"7","author":"J. Demsar","year":"2006","unstructured":"Demsar, J.: Statistical comparisons of classifiers over multiple data sets. The Journal of Machine Learning Research\u00a07, 1\u201330 (2006)","journal-title":"The Journal of Machine Learning Research"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local Branching. Mathematical Programming\u00a098, 23\u201347 (2003)","journal-title":"Mathematical Programming"},{"key":"9_CR7","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.: The multidimensional 0\u20131 knapsack problem: An overview. European Journal of Operational Research\u00a0155, 1\u201321 (2004)","journal-title":"European Journal of Operational Research"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0166-218X(94)90209-7","volume":"49","author":"A. Fr\u00e9ville","year":"1994","unstructured":"Fr\u00e9ville, A., Plateau, G.: An efficient preprocessing procedure for the multidimensional 0\u20131 knapsack problem. Discrete Applied Mathematics\u00a049, 189\u2013212 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF00247210","volume":"2","author":"A. Fr\u00e9ville","year":"1996","unstructured":"Fr\u00e9ville, A., Plateau, G.: The 0-1 bidimensional knapsack problem: towards an efficient high-level primitive tool. Journal of Heuristics\u00a02, 147\u2013167 (1996)","journal-title":"Journal of Heuristics"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M. Friedman","year":"1940","unstructured":"Friedman, M.: A comparison of alternative tests of significance for the problem of m rankings. The Annals of Mathematical Statistics\u00a011, 86\u201392 (1940)","journal-title":"The Annals of Mathematical Statistics"},{"key":"9_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. WH Freeman, San Francisco (1979)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-540-72792-7_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"S. Ghosh","year":"2007","unstructured":"Ghosh, S.: DINS, a MIP improvement heuristic. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 310\u2013323. Springer, Heidelberg (2007)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"P.C. Gilmore","year":"1966","unstructured":"Gilmore, P.C., Gomory, R.E.: The theory and computation of knapsack functions. Operations Research\u00a014, 1045\u20131075 (1966)","journal-title":"Operations Research"},{"key":"9_CR14","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, G.A.: Critical event tabu search for multidimensional knapsack problems. In: Osman, I., Kelly, J. (eds.) Meta Heuristics: Theory and Applications, pp. 407\u2013427. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"9_CR15","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., Fr\u00e9ville, A.: An efficient tabu search approach for the 0\u2013l multidimensional knapsack problem. European Journal of Operational Research\u00a0106, 659\u2013675 (1998)","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"9_CR16","doi-asserted-by":"publisher","first-page":"3034","DOI":"10.1016\/j.cor.2005.02.033","volume":"33","author":"P. Hansen","year":"2006","unstructured":"Hansen, P., Mladenovi\u0107, N., Uro\u0161evi\u0107, D.: Variable neighborhood search and local branching. Computers & Operations Research\u00a033(10), 3034\u20133045 (2006)","journal-title":"Computers & Operations Research"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N., Perez-Britos, D.: Variable Neighborhood Decomposition Search. Journal of Heuristics\u00a07, 335\u2013350 (2001)","journal-title":"Journal of Heuristics"},{"doi-asserted-by":"crossref","unstructured":"Hanafi, S., Wilbaut, C.: Improved convergent heuristics for the 0\u20131 multidimensional knapsack problem. Annals of Operations Research (2009), doi: 10.1007\/s10479-009-0546-z","key":"9_CR18","DOI":"10.1007\/s10479-009-0546-z"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1080\/03610928008827904","volume":"9","author":"R.L. Iman","year":"1980","unstructured":"Iman, R.L., Davenport, J.M.: Approximations of the critical region of the Friedman statistic. Communications in Statistics \u2013 Theory and Methods\u00a09, 571\u2013595 (1980)","journal-title":"Communications in Statistics \u2013 Theory and Methods"},{"issue":"6","key":"9_CR20","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1016\/j.cor.2009.09.010","volume":"37","author":"J. Lazi\u0107","year":"2010","unstructured":"Lazi\u0107, J., Hanafi, S., Mladenovi\u0107, N., Uro\u0161evi\u0107, D.: Variable neighbourhood decomposition search for 0\u20131 mixed integer programs. Computers & Operations Research\u00a037(6), 1055\u20131067 (2010)","journal-title":"Computers & Operations Research"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1086\/294081","volume":"28","author":"J. Lorie","year":"1955","unstructured":"Lorie, J., Savage, L.J.: Three problems in capital rationing. Journal of Business\u00a028, 229\u2013239 (1955)","journal-title":"Journal of Business"},{"key":"9_CR22","series-title":"Annals of Information Systems","volume-title":"Matheuristics: Hybridizing Metaheuristics and Mathematical Programming","year":"2009","unstructured":"Maniezzo, V., Stutzle, T., Voss, S. (eds.): Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems, vol.\u00a010. Springer, Heidelberg (2009)"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1287\/opre.45.5.768","volume":"45","author":"S. Martello","year":"1997","unstructured":"Martello, S., Toth, P.: Upper bounds and algorithms for hard 0\u20131 knapsack problems. Operations Research\u00a045, 768\u2013778 (1997)","journal-title":"Operations Research"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers & Operations Research"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0377-2217(94)00013-3","volume":"87","author":"D. Pisinger","year":"1995","unstructured":"Pisinger, D.: An expanding-core algorithm for the exact 0\u20131 knapsack problem. European Journal of Operational Research\u00a087, 175\u2013187 (1995)","journal-title":"European Journal of Operational Research"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11499305_5","volume-title":"Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach","author":"J. Puchinger","year":"2005","unstructured":"Puchinger, J., Raidl, G.R.: Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification. In: Mira, J., \u00c1lvarez, J.R. (eds.) IWINAC 2005. LNCS, vol.\u00a03562, pp. 41\u201353. Springer, Heidelberg (2005)"},{"issue":"3","key":"9_CR27","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0377-2217(78)90093-0","volume":"2","author":"A.L. Soyster","year":"1978","unstructured":"Soyster, A.L., Lev, B., Slivka, W.: Zero-One Programming with Many Variables and Few Constraints. European Journal of Operational Research\u00a02(3), 195\u2013201 (1978)","journal-title":"European Journal of Operational Research"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1051\/ro:2001123","volume":"35","author":"M. Vasquez","year":"2001","unstructured":"Vasquez, M., Hao, J.K.: Une approche hybride pour le sac\u2013\u00e0\u2013dos multidimensionnel en variables 0\u20131. RAIRO Operations Research\u00a035, 415\u2013438 (2001)","journal-title":"RAIRO Operations Research"},{"key":"9_CR29","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.: Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem. Journal of Combinatorial Optimization\u00a015, 165\u2013178 (2008)","journal-title":"Journal of Combinatorial Optimization"},{"key":"9_CR30","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2008.01.044","volume":"195","author":"C. Wilbaut","year":"2009","unstructured":"Wilbaut, C., Hanafi, S.: New convergent heuristics for 0\u20131 mixed integer programming. European Journal of Operational Research\u00a0195, 62\u201374 (2009)","journal-title":"European Journal of Operational Research"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1093\/imaman\/dpn004","volume":"19","author":"C. Wilbaut","year":"2008","unstructured":"Wilbaut, C., Hanafi, S., Salhi, S.: A survey of effective heuristics and their application to a variety of knapsack problems. IMA Journal of Management Mathematics\u00a019, 227\u2013244 (2008)","journal-title":"IMA Journal of Management Mathematics"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16054-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T05:56:11Z","timestamp":1553147771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16054-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160530","9783642160547"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16054-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}