{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:33:41Z","timestamp":1729672421044,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/codit.2014.6996879","type":"proceedings-article","created":{"date-parts":[[2014,12,31]],"date-time":"2014-12-31T04:14:48Z","timestamp":1419999288000},"page":"117-122","source":"Crossref","is-referenced-by-count":2,"title":["An exact solution search for the max-min multiple knapsack problem"],"prefix":"10.1109","author":[{"given":"Ferhan","family":"Al-Maliky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mhand","family":"Hifi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hedi","family":"Mhalla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00165-3"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0819-9_22"},{"key":"12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0377-2217(96)00155-5","article-title":"A branch and bound algorithm for the min-max spanning forest problem","volume":"101","author":"yamada","year":"1997","journal-title":"European Journal of Operational"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.6.1045"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2010.10.015"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.047"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(93)90079-X"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)E0271-X"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2003.11.005"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.10.004"},{"key":"9","first-page":"582","article-title":"An algorithm for the multidimensional multiple-choice knapsack problem","volume":"3 e80 a","author":"moser","year":"1997","journal-title":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences"},{"key":"8","first-page":"145","article-title":"Performance of two heuristics for solving large scale two-dimensional guillotine cutting problems","volume":"33","author":"morabito","year":"1995","journal-title":"INFOR"}],"event":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","start":{"date-parts":[[2014,11,3]]},"location":"Metz, France","end":{"date-parts":[[2014,11,5]]}},"container-title":["2014 International Conference on Control, Decision and Information Technologies (CoDIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6982036\/6996851\/06996879.pdf?arnumber=6996879","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T02:55:42Z","timestamp":1498186542000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6996879\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/codit.2014.6996879","relation":{},"subject":[],"published":{"date-parts":[[2014,11]]}}}