{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T07:44:25Z","timestamp":1773128665781,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0377-2217(99)00260-x","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"325-332","source":"Crossref","is-referenced-by-count":226,"title":["New trends in exact algorithms for the 0\u20131 knapsack problem"],"prefix":"10.1016","volume":"123","author":[{"given":"Silvano","family":"Martello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Pisinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00260-X_BIB1","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","article-title":"An algorithm for large zero\u2013one knapsack problems","volume":"28","author":"Balas","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB2","unstructured":"R.E. Bellman, Dynamic Programming, Princeton University Press, Princeton, NJ, 1957"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB3","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","article-title":"Discrete variable extremum problems","volume":"5","author":"Dantzig","year":"1957","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB4","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/BF01580448","article-title":"Resolution of the 0\u20131 knapsack problem: Comparison of methods","volume":"8","author":"Fayard","year":"1975","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02241754","article-title":"An algorithm for the solution of the 0\u20131 knapsack problem","volume":"28","author":"Fayard","year":"1982","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB6","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0377-2217(93)90197-U","article-title":"An exact search for the solution of the surrogate dual of the 0\u20131 bi-dimensional knapsack problem","volume":"68","author":"Freville","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","article-title":"Computing partitions with applications to the knapsack problem","volume":"21","author":"Horowitz","year":"1974","journal-title":"Journal of ACM"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB8","doi-asserted-by":"crossref","unstructured":"S. Martello, D. Pisinger, P. Toth, Dynamic programming and strong bounds for the 0\u20131 knapsack problem, Management Science 45 (1999) 414\u2013424","DOI":"10.1287\/mnsc.45.3.414"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(77)90024-8","article-title":"An upper bound for the zero\u2013one knapsack problem and a branch and bound algorithm","volume":"1","author":"Martello","year":"1977","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB10","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1287\/mnsc.34.5.633","article-title":"A new algorithm for the 0\u20131 knapsack problem","volume":"34","author":"Martello","year":"1988","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB11","unstructured":"S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, Chichester, UK, 1990"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB12","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/opre.45.5.768","article-title":"Upper bounds and algorithms for hard 0\u20131 knapsack problems","volume":"45","author":"Martello","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB13","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/mnsc.23.1.27","article-title":"An efficient algorithm for the 0\u20131 knapsack problem","volume":"23","author":"Nauss","year":"1976","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0377-2217(94)00013-3","article-title":"An expanding-core algorithm for the exact 0\u20131 knapsack problem","volume":"87","author":"Pisinger","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB15","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","article-title":"A minimal algorithm for the 0\u20131 knapsack problem","volume":"45","author":"Pisinger","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00260-X_BIB16","first-page":"277","article-title":"A hybrid method for the 0\u20131 knapsack problem","volume":"49","author":"Plateau","year":"1985","journal-title":"Methods of Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179900260X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179900260X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T03:24:52Z","timestamp":1556162692000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722179900260X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S037722179900260X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00260-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}