{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:56:57Z","timestamp":1773752217053,"version":"3.50.1"},"reference-count":46,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/cec.2013.6557817","type":"proceedings-article","created":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T18:57:12Z","timestamp":1374778632000},"page":"2102-2107","source":"Crossref","is-referenced-by-count":10,"title":["Using surrogate information to solve the multidimensional multi-choice knapsack problem"],"prefix":"10.1109","author":[{"given":"Skander","family":"Htiouech","sequence":"first","affiliation":[]},{"given":"Sadok","family":"Bouamama","sequence":"additional","affiliation":[]},{"given":"Rabeh","family":"Attia","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"36978","article-title":"A branch and bound method for the multi constraint zero-one knapsack problem","author":"shih","year":"1979","journal-title":"Journal of Operations Research Society"},{"key":"35","first-page":"312","article-title":"Solving the multidimensional multi-choice knapsack problem with the help of ants","author":"iqbal","year":"2010","journal-title":"ANTS Conference"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.13.9.736"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1038\/sj\/jors\/0411109"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.6.1045"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"15","first-page":"15968","article-title":"Dominance in multi-dimensional multiplechoice knapsack problems","volume":"15","author":"dyer","year":"1998","journal-title":"Asia-Pacific Journal of the Operational Research"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1504\/IJOR.2007.014176"},{"key":"16","first-page":"485","article-title":"Capital budgeting of interrelated projects: Survey and synthesis","volume":"12","author":"weingatner","year":"1966","journal-title":"Operations Research"},{"key":"39","article-title":"A column generation method for the multiple-choice multi-dimensional knapsack problem","author":"hifi","year":"2008","journal-title":"Comput Optim App Online First"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0969-6016(94)90004-3"},{"key":"14","first-page":"274317","volume":"36","author":"lin","year":"1998","journal-title":"A Bibliographical Survey on Some Well-known Non-standard Knapsack Problems"},{"key":"37","first-page":"159","article-title":"Des fourmis pour le sac-dos multidimensionnel","author":"alaya","year":"2004","journal-title":"Dans 4mes Journes Francophones de Recherche Oprationnelle (Francoro 2004)"},{"key":"11","author":"martello","year":"1990","journal-title":"Knapsack Problems"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.04.006"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.1.122"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.4.741"},{"key":"20","first-page":"82114","article-title":"Lagrangian relaxation for integer programming","volume":"2","author":"geo-rion","year":"1974","journal-title":"Mathematical Programming Study"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1109\/ISSOC.2006.321966"},{"key":"42","article-title":"TOURISM-KM A variant of MMKP applied to the tourism domain","author":"picot-clmente","year":"2012","journal-title":"ICORES 2012 Portugal"},{"key":"41","first-page":"1","article-title":"A hybrid heuristic for the multiple choice multidimensional knapsack problem","author":"mansia","year":"2011","journal-title":"Engineering Optimization First"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-006-9035-3"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1100\/2012\/583973"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/696491"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/682073"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-5915.1977.tb01074.x"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009642405419"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.48.4.550.208"},{"key":"25","article-title":"An exact algorithm for the multiple-choice multidimensional knapsack problem","author":"hifi","year":"2004","journal-title":"Cahiers de la MSE b04024 Maison des Sciences Economiques"},{"key":"26","first-page":"161","article-title":"Solving the knapsack problem for adaptive multimedia system","volume":"2","author":"khan","year":"2002","journal-title":"Studia Informatica"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601796"},{"key":"28","first-page":"708","article-title":"A New Heuristic for Solving the Multi-choice Multidimensional knapsack problem\". Systems, Man and Cybernetics, Part A: Systems and Humans","volume":"35","author":"parra-hemendez","year":"2005","journal-title":"IEEE Transactions"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-005-3057-0"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00296-8"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1361-8_25"},{"key":"10","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP Completeness"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_33"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(86)90048-1"},{"key":"7","author":"khan","year":"1998","journal-title":"Quality adaptation in a multisession multimedia system Model algorithms and architecture"},{"key":"6","author":"chen","year":"1998","journal-title":"The Utility Model Applied to Layer-coded Sources Dept of Computer Science"},{"key":"32","article-title":"A new strategy for solving multiple-choice multiple-dimension knapsack problem in pram model","author":"mwh","year":"2005","journal-title":"Asian Applied Computing Conference"},{"key":"5","first-page":"8693","article-title":"Declarative scheduling for optimally graceful QoS degradation in Proc","author":"moser","year":"1996","journal-title":"IEEE Int Conf Multimedia Computing Systems (ICMCS"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/RTTAS.1999.777680"},{"key":"4","author":"glover","year":"1998","journal-title":"Surrogate Constraints Tutorial Notes"},{"key":"9","first-page":"111","article-title":"The Utility Model for Adaptive Multimedia System","author":"khan","year":"1997","journal-title":"Int Workshop on Multimedia Modeling"},{"key":"8","author":"watson","year":"2001","journal-title":"The optimal admission and adaptation of service level agreements in packet networks Applying the utility model"}],"event":{"name":"2013 IEEE Congress on Evolutionary Computation (CEC)","location":"Cancun, Mexico","start":{"date-parts":[[2013,6,20]]},"end":{"date-parts":[[2013,6,23]]}},"container-title":["2013 IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6552460\/6557545\/06557817.pdf?arnumber=6557817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T21:04:37Z","timestamp":1490216677000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6557817\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/cec.2013.6557817","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}