{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:18:05Z","timestamp":1760707085064},"reference-count":18,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0305-0548(03)00021-2","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T14:52:27Z","timestamp":1046789547000},"page":"695-711","source":"Crossref","is-referenced-by-count":13,"title":["A branch & bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints"],"prefix":"10.1016","volume":"31","author":[{"given":"George","family":"Kozanidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuel","family":"Melachrinoudis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00021-2_BIB1","first-page":"274","article-title":"A bibliographical survey on some well known non-standard knapsack problems","volume":"36","author":"Lin","year":"1998","journal-title":"INFOR"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB2","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0167-6377(81)90019-5","article-title":"A note on the knapsack problem with special ordered sets","volume":"1","author":"Johnson","year":"1981","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF01588255","article-title":"An O(nlogn) algorithm for LP knapsacks with GUB constraints","volume":"17","author":"Glover","year":"1979","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB4","doi-asserted-by":"crossref","unstructured":"Witzgall C. On one-row linear programs. In: Fiacco AV, Kortane KO editors. Ext. methods and systems analysis. Berlin: Springer, 1980. p. 384\u2013414.","DOI":"10.1007\/978-3-642-46414-0_19"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02591729","article-title":"An O(n) algorithm for the multiple-choice knapsack linear program","volume":"29","author":"Dyer","year":"1984","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0167-6377(84)90027-0","article-title":"A fast algorithm for the linear multiple-choice knapsack problem","volume":"3","author":"Dudzinski","year":"1984","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(84)90014-0","article-title":"An O(n) algorithm for the linear multiple choice knapsack problem and related problems","volume":"18","author":"Zemel","year":"1984","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB8","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/BFb0121045","article-title":"On the solution of special generalized upper-bounded problems: the LP\/GUB knapsack problem and the \u03bb-form separable convex objective function problem","volume":"24","author":"Gass","year":"1985","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0167-6377(89)90008-4","article-title":"The linear multiple choice knapsack problem","volume":"8","author":"Sarin","year":"1989","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB10","doi-asserted-by":"crossref","first-page":"1412","DOI":"10.1287\/opre.28.6.1412","article-title":"The linear multiple choice knapsack problem","volume":"28","author":"Zemel","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(76)90048-7","article-title":"Approximate algorithms for some generalized knapsack problems","volume":"3","author":"Chandra","year":"1976","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1287\/opre.27.3.503","article-title":"The multiple choice knapsack problem","volume":"27","author":"Sinha","year":"1979","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB13","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/357456.357458","article-title":"A computational study of a multiple-choice knapsack algorithm","volume":"9","author":"Armstrong","year":"1983","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB14","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0377-2217(95)00015-I","article-title":"A minimal algorithm for the multiple choice knapsack problem","volume":"83","author":"Pisinger","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB15","series-title":"Linear programming and extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB16","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","article-title":"An efficient algorithm for determining the convex hull of a finite planar set","volume":"1","author":"Graham","year":"1972","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB17","series-title":"Introduction to algorithms","author":"Cormen","year":"2001"},{"key":"10.1016\/S0305-0548(03)00021-2_BIB18","unstructured":"LINGO. User's guide. Chicago, IL: LINDO Systems, Inc., http:\/\/www.lindo.com\/, 2001."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000212?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000212?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T06:30:15Z","timestamp":1553668215000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803000212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0305054803000212"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00021-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}