{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T00:43:48Z","timestamp":1700613828867},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"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":[[1976,1]]},"DOI":"10.1016\/0305-0548(76)90004-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"27-38","source":"Crossref","is-referenced-by-count":4,"title":["A dynamic programming branch and bound algorithm for pure integer programming"],"prefix":"10.1016","volume":"3","author":[{"given":"R.J.","family":"Aust","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(76)90004-6_BIB1","series-title":"Applied Dynamic Programming","author":"Bellman","year":"1962"},{"key":"10.1016\/0305-0548(76)90004-6_BIB2","series-title":"Integer Programming","author":"Garflnkel","year":"1972"},{"key":"10.1016\/0305-0548(76)90004-6_BIB3","article-title":"The Application of Dynamic Programming to the Solution of the 01 Integer Linear Programming Problem","author":"Glass","year":"1966"},{"key":"10.1016\/0305-0548(76)90004-6_BIB4","doi-asserted-by":"crossref","first-page":"B51","DOI":"10.1287\/mnsc.15.2.B51","article-title":"An extension of Lawler and Bell's method of discrete optimization with examples from capital budgeting","volume":"15","author":"Mao","year":"1968","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(76)90004-6_BIB5","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1287\/mnsc.15.9.494","article-title":"Discrete dynamic programming and capital allocation","volume":"15","author":"Nemhauser","year":"1969","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(76)90004-6_BIB6","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.13.9.736","article-title":"Computational experience with variants of the Balas algorithm applied to the selection of R & D projects","volume":"13","author":"Peterson","year":"1967","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(76)90004-6_BIB7","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1287\/mnsc.15.9.481","article-title":"Integer linear programming; a study in computational efficiency","volume":"15","author":"Trauth","year":"1969","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(76)90004-6_BIB8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/opre.15.1.83","article-title":"Methods for the solution of the multidimensional 01 knapsack problem","volume":"15","author":"Weingartner","year":"1967","journal-title":"Ops. Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054876900046?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054876900046?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:24:47Z","timestamp":1552911887000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054876900046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,1]]}},"alternative-id":["0305054876900046"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(76)90004-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1976,1]]}}}