{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:56:51Z","timestamp":1773752211240,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T00:00:00Z","timestamp":1264982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1016\/j.cor.2009.04.015","type":"journal-article","created":{"date-parts":[[2009,5,8]],"date-time":"2009-05-08T08:50:34Z","timestamp":1241772634000},"page":"247-255","source":"Crossref","is-referenced-by-count":18,"title":["A hybrid of Nested Partition, Binary Ant System, and Linear Programming for the multidimensional knapsack problem"],"prefix":"10.1016","volume":"37","author":[{"given":"S.","family":"Al-Shihabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"\u00d3lafsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.cor.2009.04.015_bib1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","article-title":"The multidimensional 0\u20131 knapsack problem: an overview","volume":"155","author":"Fr\u00e9ville","year":"2004","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2009.04.015_bib2","series-title":"Knapsack problems","author":"Kellerer","year":"2004"},{"issue":"8","key":"10.1016\/j.cor.2009.04.015_bib3","doi-asserted-by":"crossref","first-page":"2672","DOI":"10.1016\/j.cor.2006.12.029","article-title":"A new ant colony optimization algorithm for the multidimensional knapsack problem","volume":"35","author":"Kong","year":"2008","journal-title":"Computers and Operations Research"},{"issue":"3","key":"10.1016\/j.cor.2009.04.015_bib4","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/opre.48.3.390.12436","article-title":"Nested partition methods for global optimization","volume":"48","author":"Shi","year":"2000","journal-title":"Operations Research"},{"key":"10.1016\/j.cor.2009.04.015_bib5","series-title":"Nested partition optimization: (methodology and applications). International series in operations research and management science","author":"Shi","year":"2008"},{"key":"10.1016\/j.cor.2009.04.015_bib6","series-title":"Ant colony optimization","author":"Dorigo","year":"2004"},{"issue":"9","key":"10.1016\/j.cor.2009.04.015_bib7","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"Max\u2013min ant system","volume":"16","author":"St\u00fctzle","year":"2000","journal-title":"Future Generation Computer System"},{"issue":"2","key":"10.1016\/j.cor.2009.04.015_bib8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","article-title":"Ant colonies for the quadratic assignment problem","volume":"50","author":"Gamardella","year":"1999","journal-title":"Journal of Operations Research Society"},{"key":"10.1016\/j.cor.2009.04.015_bib9","doi-asserted-by":"crossref","unstructured":"Leguizamon G, Michalewicz Z. A new version of ant system for subset problem. In: Congress on evolutionary computation; 1999. p. 1459\u201364.","DOI":"10.1109\/CEC.1999.782655"},{"key":"10.1016\/j.cor.2009.04.015_bib10","unstructured":"Fidanova S. Evolutionary algorithm for multidimensional knapsack problem. In: PPSNBII\u2014Workshop, 2002."},{"key":"10.1016\/j.cor.2009.04.015_bib11","unstructured":"Alaya I, Solnon C, Gheira K. Ant algorithm for the multi-dimensional knapsack problem. In: International conference on bioinspired optimization methods and their applications. BIOMA 2004; October 2004, p. 63\u201372."},{"issue":"2","key":"10.1016\/j.cor.2009.04.015_bib12","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","article-title":"The hyper-cube framework for ant colony optimization","volume":"34","author":"Blum","year":"2004","journal-title":"IEEE on Man, Systems and Cybernetics\u2014Part B"},{"issue":"3","key":"10.1016\/j.cor.2009.04.015_bib13","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1010081212560","article-title":"Nested partition method for stochastic optimization","volume":"2","author":"Shi","year":"2000","journal-title":"Methodology and Computing in Applied Probability"},{"issue":"4","key":"10.1016\/j.cor.2009.04.015_bib14","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0305-0548(98)00068-9","article-title":"New parallel randomized algorithms for the traveling salesman problem","volume":"26","author":"Shi","year":"1999","journal-title":"Computers and Operations Research"},{"issue":"2","key":"10.1016\/j.cor.2009.04.015_bib15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0360-8352(99)00140-0","article-title":"A new hybrid optimization algorithm","volume":"36","author":"Shi","year":"1999","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/j.cor.2009.04.015_bib16","unstructured":"Al-Shihabi S. Ants for sampling in the Nested Partition Algorithm. Hybrid metaheuristic; 2004. p. 11\u20138."},{"key":"10.1016\/j.cor.2009.04.015_bib17","doi-asserted-by":"crossref","unstructured":"Al-Shihabi S. Backtracking Ant System for the traveling salesman problem. In: Ants workshop, 2004. p. 318\u201325.","DOI":"10.1007\/978-3-540-28646-2_30"},{"issue":"4","key":"10.1016\/j.cor.2009.04.015_bib18","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1109\/TASE.2008.916761","article-title":"Hybrid nested partitions and mathematical programming approach and its applications","volume":"5","author":"Pi","year":"2008","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"1","key":"10.1016\/j.cor.2009.04.015_bib19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","article-title":"A genetic algorithm for the multiconstrained knapsack problem","volume":"4","author":"Chu","year":"1998","journal-title":"Journal of Heuristics"},{"issue":"1","key":"10.1016\/j.cor.2009.04.015_bib20","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2004.01.024","article-title":"Improved results on the 0\u20131 multidimensional knapsack problem","volume":"165","author":"Vasquez","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2009.04.015_bib21","unstructured":"Osorio M, Glover F, Hammer P. Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions. Technical Report HCES-08-00, Herin Center For Enterprise Science, The University of Mississippi; August 2000."},{"key":"10.1016\/j.cor.2009.04.015_bib22","unstructured":"Vasquez M, Hao J. A hybrid approach for the 0\u20131 multidimensional knapsack problem. In: Proceedings of the international joint conference on artificial intelligence, 2001. p. 328\u201333."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0305054809001233?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0305054809001233?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T09:33:12Z","timestamp":1739093592000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054809001233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["S0305054809001233"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.cor.2009.04.015","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2010,2]]}}}