{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T09:25:54Z","timestamp":1654766754493},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":[[1983,1]]},"DOI":"10.1016\/0305-0548(83)90017-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"249-254","source":"Crossref","is-referenced-by-count":1,"title":["Accelerated primal-dual cutting plane algorithm for all-integer programming"],"prefix":"10.1016","volume":"10","author":[{"given":"Parviz","family":"Ghandforoush","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(83)90017-5_BIB1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1287\/opre.22.1.129","article-title":"Iteration skipping in primal integer programming","volume":"22","author":"Arnold","year":"1974","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90017-5_BIB2","article-title":"A bounded descent algorithm for integer programming","author":"Austin","year":"1979"},{"key":"10.1016\/0305-0548(83)90017-5_BIB3","series-title":"National ORSA\/TIMS meeting","article-title":"A bounded dual (all-integer) integer programming algorithm with an objective cut","author":"Austin","year":"1980"},{"key":"10.1016\/0305-0548(83)90017-5_BIB4","series-title":"A constructive primal-dual algorithm for all-integer programming","author":"Ghandforoush","year":"1980"},{"key":"10.1016\/0305-0548(83)90017-5_BIB5","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1002\/nav.3800280405","article-title":"A primal-dual cutting-plane algorithm for all-integer programming","volume":"28","author":"Ghandforoush","year":"1981","journal-title":"Naval Res. Logistics Quart."},{"key":"10.1016\/0305-0548(83)90017-5_BIB6","first-page":"167","article-title":"A pseudo-primal-dual integer programming algorithm","volume":"718","author":"Glover","year":"1967","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0305-0548(83)90017-5_BIB7","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","article-title":"Outline of an algorithm for integer solutions to linear programs","volume":"64","author":"Gomory","year":"1958","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/0305-0548(83)90017-5_BIB8","series-title":"Recent Advances in Mathematical Programming","article-title":"An algorithm for integer solutions to linear programs","author":"Gomory","year":"1963"},{"key":"10.1016\/0305-0548(83)90017-5_BIB9","article-title":"25 integer programming test problems","author":"Haldi","year":"1964"},{"key":"10.1016\/0305-0548(83)90017-5_BIB10","series-title":"An investigation of advanced start techniques for all-integer cutting plane algorithms for integer programming","author":"Hanna","year":"1981"},{"key":"10.1016\/0305-0548(83)90017-5_BIB11","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1287\/opre.17.4.638","article-title":"An algorithm for pure integer programming","volume":"17","author":"Hillier","year":"1969","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(83)90017-5_BIB12","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1287\/mnsc.15.9.481","article-title":"Integer programming: a study in computational efficiency","volume":"15","author":"Trauth","year":"1969","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(83)90017-5_BIB13","series-title":"Applied Management Science","author":"Woolsey","year":"1980"},{"key":"10.1016\/0305-0548(83)90017-5_BIB14","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1287\/opre.16.4.750","article-title":"A simplified primal (all-integer) integer programming algorithm","volume":"16","author":"Young","year":"1968","journal-title":"Ops Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054883900175?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054883900175?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:29:47Z","timestamp":1552926587000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054883900175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["0305054883900175"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(83)90017-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}