{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:18:16Z","timestamp":1725538696091},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642049170"},{"type":"electronic","value":"9783642049187"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04918-7_6","type":"book-chapter","created":{"date-parts":[[2009,10,6]],"date-time":"2009-10-06T06:08:27Z","timestamp":1254809307000},"page":"73-83","source":"Crossref","is-referenced-by-count":7,"title":["Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Sa\u00efd","family":"Hanafi","sequence":"first","affiliation":[]},{"given":"Ra\u00efd","family":"Mansi","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Wilbaut","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1016\/j.cor.2004.09.016","volume":"33","author":"M.M. Akbar","year":"2006","unstructured":"Akbar, M.M., Rahman, M.S., Kaykobad, M., Manning, E.G., Shoja, G.C.: Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls. Computers & Operations Research\u00a033, 1259\u20131273 (2006)","journal-title":"Computers & Operations Research"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BFb0097911","volume-title":"Parallel and Distributed Processing","author":"L. Chen","year":"1999","unstructured":"Chen, L., Khan, S., Li, K.F., Manning, E.G.: Building an adaptive multimedia system using the utility model. In: Rolim, J.D.P. (ed.) IPPS-WS 1999 and SPDP-WS 1999. LNCS, vol.\u00a01586, pp. 289\u2013298. Springer, Heidelberg (1999)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Cherfi, N., Hifi, M.: A column generation method for the multiple\u2013choice multi\u2013dimensional knapsack problem. Computational Optimization and Applications (2008), doi:10.1007\/s10589-008-9184-7","DOI":"10.1007\/s10589-008-9184-7"},{"key":"6_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":"6_CR5","first-page":"43","volume":"58","author":"M.E. Dyer","year":"1995","unstructured":"Dyer, M.E., Riha, W.O., Walker, J.: A hybrid dynamic programming\/branch and bound algorithm for the multiple\u2013choice knapsack problem. European Journal of Operational Research\u00a058, 43\u201354 (1995)","journal-title":"European Journal of Operational Research"},{"key":"6_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":"6_CR7","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., Mladenovic, N., Urosevic, D.: Variable neighbourhood search and local branching. Computers & Operations Research\u00a033, 3034\u20133045 (2006)","journal-title":"Computers & Operations Research"},{"key":"6_CR8","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","DOI":"10.1007\/s10479-009-0546-z"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1057\/palgrave.jors.2601796","volume":"55","author":"M. Hifi","year":"2004","unstructured":"Hifi, M., Michrafy, M., Sbihi, A.: Heuristic algorithms for the multiple\u2013choice multidimensional knapsack problem. Journal of the Operational Research Society\u00a055, 1323\u20131332 (2004)","journal-title":"Journal of the Operational Research Society"},{"key":"6_CR10","first-page":"157","volume":"2","author":"S. Khan","year":"2002","unstructured":"Khan, S., Li, K.F., Manning, E.G., Akbar, M.M.: Solving the knapsack problem for adaptive multimedia systems. Studia Informatica Universalis\u00a02, 157\u2013178 (2002)","journal-title":"Studia Informatica Universalis"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0305-0548(02)00192-2","volume":"31","author":"V.C. Li","year":"2004","unstructured":"Li, V.C., Curry, G.L., Boyd, E.A.: Towards the real time solution of strike force asset allocation problems. Computers & Operations Research\u00a031, 273\u2013291 (2004)","journal-title":"Computers & Operations Research"},{"issue":"E80","key":"6_CR12","first-page":"582","volume":"A","author":"M. Moser","year":"1997","unstructured":"Moser, M., Jokanovic, D.P., Shiratori, N.: An algorithm for the multidimensional multiple\u2013choice knapsack problem. IEICE Transactions\u00a0A(E80), 582\u2013589 (1997)","journal-title":"IEICE Transactions"},{"key":"6_CR13","unstructured":"Parra-Hernandez, R., Dimopoulos, N.: A new heuristic for solving the multi-choice multidimensional knapsack problem. Technical Report, Department of Electrical and Computer Engineering, University of Victoria (2002)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A","volume":"34","author":"H. Pirkul","year":"1987","unstructured":"Pirkul, H.: A heuristic solution procedure for the multiconstraint zero\u2013one knapsack problem. Naval Research Logistics\u00a034, 161\u2013172 (1987)","journal-title":"Naval Research Logistics"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/0377-2217(95)00015-I","volume":"83","author":"D. Pisinger","year":"1995","unstructured":"Pisinger, D.: A minimal algorithm for the multiple\u2013choice knapsack problem. European Journal of Operational Research\u00a083, 394\u2013410 (1995)","journal-title":"European Journal of Operational Research"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/S0377-2217(99)00451-8","volume":"129","author":"D. Pisinger","year":"2001","unstructured":"Pisinger, D.: Budgeting with bounded multiple-choice constraints. European Journal of Operational Research\u00a0129, 471\u2013480 (2001)","journal-title":"European Journal of Operational Research"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1287\/opre.27.3.503","volume":"27","author":"A. Sinha","year":"1979","unstructured":"Sinha, A., Zoltners, A.: The multiple\u2013choice knapsack problem. Operations Research\u00a027, 503\u2013515 (1979)","journal-title":"Operations Research"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1287\/mnsc.21.12.1417","volume":"21","author":"Y. Toyoda","year":"1975","unstructured":"Toyoda, Y.: A simplified algorithm for obtaining approximate solution to zero\u2013one programming problems. Management Sciences\u00a021, 1417\u20131427 (1975)","journal-title":"Management Sciences"},{"key":"6_CR19","unstructured":"Watson, R.K.: Packet Networks and optimal admission and upgrade of service level agreements: applying the utility model. M.A.Sc. Thesis, Department of ECE, University of Victoria (2001)"},{"key":"6_CR20","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":"6_CR21","first-page":"579","volume":"35","author":"C. Wilbaut","year":"2006","unstructured":"Wilbaut, C., Hanafi, S., Fr\u00e9ville, A., Balev, S.: Tabu Search: Global Intensification using Dynamic Programming. Control and Cybernetics\u00a035, 579\u2013598 (2006)","journal-title":"Control and Cybernetics"},{"key":"6_CR22","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-04918-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T04:16:09Z","timestamp":1552191369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04918-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049170","9783642049187"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04918-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}