{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T07:47:04Z","timestamp":1743752824371},"reference-count":24,"publisher":"Informa UK Limited","issue":"5","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2017,9,3]]},"DOI":"10.1080\/10556788.2016.1240795","type":"journal-article","created":{"date-parts":[[2016,11,2]],"date-time":"2016-11-02T11:14:58Z","timestamp":1478085298000},"page":"1078-1094","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":5,"title":["An exact constructive algorithm for the knapsack sharing problem"],"prefix":"10.1080","volume":"32","author":[{"given":"Hedi","family":"Mhalla","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, American University of the Middle East, Egaila 15453, Kuwait"},{"name":"U.R EP-ROAD, Universite de Picardie Jules Verne, Amiens 80025, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2016,11,2]]},"reference":[{"key":"CIT0001","doi-asserted-by":"crossref","first-page":"11042","DOI":"10.1016\/j.amc.2012.05.001","volume":"218","author":"Bansal J.C.","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2010.10.015"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1287\/opre.27.2.341"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/BF01586926"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/BF02241754"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.01.049"},{"key":"CIT0007","first-page":"661","volume":"66","author":"Hifi M.","year":"2010","journal-title":"Eng. Tech."},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.04.011"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2013.08.003"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013385216761"},{"key":"CIT0011","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/j.amc.2013.11.040","volume":"227","author":"Hifi M.","year":"2014","journal-title":"Appl. Math. Comput."},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019920507008"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2003.11.005"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321823"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(91)90082-Z"},{"key":"CIT0016","first-page":"51","author":"Laalaoui Y.","year":"2015","journal-title":"Artif. Intell. Appl. Inf."},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90335-7"},{"key":"CIT0018","volume-title":"Knapsack Problems: Algorithms and Computer Implementation","author":"Martello S.","year":"1990"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.5.768"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90387-1"},{"key":"CIT0021","doi-asserted-by":"crossref","first-page":"6921","DOI":"10.1016\/j.amc.2011.12.068","volume":"218","author":"Rong A.","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1287\/opre.36.2.359"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00009-9"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00165-3"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2016.1240795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T02:45:23Z","timestamp":1601174723000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2016.1240795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,2]]},"references-count":24,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2017,7,28]]},"published-print":{"date-parts":[[2017,9,3]]}},"alternative-id":["10.1080\/10556788.2016.1240795"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2016.1240795","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,2]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}