{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:19:42Z","timestamp":1759666782780},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T00:00:00Z","timestamp":1187654400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s11227-007-0144-2","type":"journal-article","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T16:44:54Z","timestamp":1187628294000},"page":"257-280","source":"Crossref","is-referenced-by-count":13,"title":["A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem"],"prefix":"10.1007","volume":"43","author":[{"given":"Abu Zafar M.","family":"Shahriar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Mostofa","family":"Akbar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad Abdul Hakim","family":"Newton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,8,21]]},"reference":[{"key":"144_CR1","doi-asserted-by":"crossref","unstructured":"Akbar MM (2002) Distributed utility model applied to optimal admission control and QoS adaptation in distributed multimedia server system and enterprise networks. PhD dissertation, University of Victoria, Victoria, BC, Canada","DOI":"10.1117\/12.434274"},{"key":"144_CR2","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1007\/3-540-45718-6_71","volume-title":"International conference on computational science","author":"MM Akbar","year":"2001","unstructured":"Akbar MM, Manning EG, Shoja GC, Khan S (2001) Heuristic solutions for the multiple-choice multi-dimension Knapsack problem. In: Alexandrov VN, Dongarra J, Juliano BA, Renner RS, Jeng C, Tan K (eds) International conference on computational science, San Francisco, CA, USA, 28\u201330 May 2001. Lecture notes in computer science. Springer, Berlin, pp 659\u2013668"},{"key":"144_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02022561","volume":"41","author":"F Dammeyer","year":"1991","unstructured":"Dammeyer F, Voss S (1991) Dynamic tabu list management using the reverse elimination method. Ann Oper Res 41:29\u201341","journal-title":"Ann Oper Res"},{"key":"144_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02242185","volume":"40","author":"A Drexel","year":"1988","unstructured":"Drexel A (1988) A simulated annealing approach to the multiconstraint zero-one Knapsack problem. Ann Comput 40:1\u20138","journal-title":"Ann Comput"},{"key":"144_CR5","unstructured":"Khan S (1998) Quality adaptation in a multi-session adaptive multimedia system: model and architecture. PhD dissertation, University of Victoria, Victoria, BC, Canada"},{"key":"144_CR6","doi-asserted-by":"crossref","unstructured":"Khan S, Li KF, Manning EG (1997) Padma: an architecture for adaptive multimedia systems. In: IEEE Pacific Rim conference on communications, computers and signal processing, Victoria, BC, Canada, 20\u201322 August 1997, pp 105\u2013108","DOI":"10.1109\/PACRIM.1997.619912"},{"key":"144_CR7","first-page":"161","volume":"2","author":"S Khan","year":"2002","unstructured":"Khan S, Li KF, Manning EG, Akbar MM (2002) Solving the Knapsack problem for adaptive multimedia system. Stud Inf Univ 2:161\u2013182","journal-title":"Stud Inf Univ"},{"key":"144_CR8","first-page":"188","volume-title":"ACM symposium of applied computation","author":"S Khuri","year":"1994","unstructured":"Khuri S, Back T, Heitkotter J (1994) The zero\/one multiple Knapsack problem and genetic algorithms. In: ACM symposium of applied computation. ACM Press, New York, pp 188\u2013193"},{"key":"144_CR9","first-page":"70","volume":"31","author":"S Martello","year":"1987","unstructured":"Martello S, Toth P (1987) Algorithms for Knapsack problems. Ann Discret Math 31:70\u201379","journal-title":"Ann Discret Math"},{"issue":"3","key":"144_CR10","first-page":"582","volume":"80","author":"M Moser","year":"1997","unstructured":"Moser M, Jokanovic DP, Shiratori N (1997) An algorithm for the multidimensional multiple-choice Knapsack problem. IEICE Trans Fundam Electron 80(3):582\u2013589","journal-title":"IEICE Trans Fundam Electron"},{"key":"144_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0377-2217(78)90108-X","volume":"2","author":"R Nauss","year":"1978","unstructured":"Nauss R (1978) The 0-1 Knapsack problem with multiple choice constraints. Eur J Oper Res 2:125\u2013131","journal-title":"Eur J Oper Res"},{"key":"144_CR12","unstructured":"Newton MAH, Sadid MWH, Akbar MM (2003) A parallel heuristic algorithm for multiple-choice multidimensional Knapsack problem. In: International conference on computer and information technology, Dhaka, Bangladesh, 19\u201321 December 2003, pp 181\u2013184"},{"key":"144_CR13","volume-title":"Unix network programming","author":"WR Stevens","year":"1998","unstructured":"Stevens WR (1998) Unix network programming, 2nd edn. PHI, New Delhi","edition":"2"},{"key":"144_CR14","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1287\/mnsc.21.12.1417","volume":"21","author":"Y Toyoda","year":"1975","unstructured":"Toyoda Y (1975) A simplified algorithm for obtaining approximate solution to zero-one programming problems. Manag Sci 21:1417\u20131427","journal-title":"Manag Sci"},{"key":"144_CR15","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1109\/TSMCA.2005.851140","volume":"35","author":"R Parra-Hernandez","year":"2005","unstructured":"Parra-Hernandez R, Dimopoulos N (2005) A new heuristic for solving the multi-choice multidimensional Knapsack problem. IEEE Trans Syst Man Cybern Part A: Syst Hum 35:708\u2013717","journal-title":"IEEE Trans Syst Man Cybern Part A: Syst Hum"},{"key":"144_CR16","doi-asserted-by":"crossref","first-page":"1323","DOI":"10.1057\/palgrave.jors.2601796","volume":"55","author":"M Hifi","year":"2004","unstructured":"Hifi M, Michrafy M, Sbihi A (2004) Algorithms for the multiple-choice multi-dimensional Knapsack problem. J Oper Res Soc 55:1323\u20131332","journal-title":"J Oper Res Soc"},{"key":"144_CR17","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1016\/j.cor.2004.09.016","volume":"33","author":"MM Akbar","year":"2006","unstructured":"Akbar MM, Rahman MS, Kaykobad M, Manning EG, Shoja GC (2006) Solving the multidimensional multiple-choice Knapsack problem by constructing convex hulls. Comput Oper Res 33:1259\u20131273","journal-title":"Comput Oper Res"},{"key":"144_CR18","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10589-005-3057-0","volume":"33","author":"M Hifi","year":"2006","unstructured":"Hifi M, Michrafy M, Sbihi A (2006) A reactive local search-based algorithm for the multiple-choice multi-dimensional Knapsack problem. Comput Optim Appl 33:271\u2013285","journal-title":"Comput Optim Appl"},{"key":"144_CR19","doi-asserted-by":"crossref","DOI":"10.1142\/2616","volume-title":"Parallel algorithms for Knapsack type problems","author":"VN Alexandrov","year":"1999","unstructured":"Alexandrov VN, Megson GM (1999) Parallel algorithms for Knapsack type problems. World Scientific, Singapore"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0144-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-007-0144-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0144-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T21:11:15Z","timestamp":1684012275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-007-0144-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,21]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["144"],"URL":"https:\/\/doi.org\/10.1007\/s11227-007-0144-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,21]]}}}