{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T06:04:23Z","timestamp":1760249063448},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":[[1985,1]]},"DOI":"10.1016\/0305-0548(85)90023-1","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"241-250","source":"Crossref","is-referenced-by-count":5,"title":["A Surrogate cutting plane algorithm for all-integer programming"],"prefix":"10.1016","volume":"12","author":[{"given":"Larry M.","family":"Austin","sequence":"first","affiliation":[]},{"given":"Parviz","family":"Ghandforoush","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(85)90023-1_BIB1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1287\/opre.22.1.137","article-title":"Iteration skipping in primal integer programming","volume":"22","author":"Arnold","year":"1974","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(85)90023-1_BIB2","article-title":"The bounded descent algorithm for all-integer programming","author":"Austin","year":"1979"},{"key":"10.1016\/0305-0548(85)90023-1_BIB3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/nav.3800300110","article-title":"An advanced dual algorithm with constraint relaxation for all-integer programming","volume":"30","author":"Austin","year":"1983","journal-title":"Naval Res. Logistics Quart."},{"key":"10.1016\/0305-0548(85)90023-1_BIB4","series-title":"Proc. Nat. Meeting of the Am. Inst. for Decision Sci.","article-title":"Constraint relaxation in a primal-dual cutting plane algorithm for all-integer programming","author":"Austin","year":"1981"},{"key":"10.1016\/0305-0548(85)90023-1_BIB5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1002\/nav.3800300208","article-title":"A bounded dual (all-integer) integer programming algorithm with an objective cut","volume":"30","author":"Austin","year":"1983","journal-title":"Naval Res. Logistics Quart."},{"key":"10.1016\/0305-0548(85)90023-1_BIB6","series-title":"A constructive primal-dual cutting plane algorithm for all-integer programming","author":"Ghandforoush","year":"1980"},{"issue":"4","key":"10.1016\/0305-0548(85)90023-1_BIB7","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(85)90023-1_BIB8","first-page":"167","article-title":"A pseudo-primal-dual integer programming algorithm","volume":"71B","author":"Glover","year":"1967","journal-title":"J. Res. Nat. Bureau Standards."},{"key":"10.1016\/0305-0548(85)90023-1_BIB9","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.16.4.741","article-title":"Surrogate constraints","volume":"16","author":"Glover","year":"1968","journal-title":"Op Res."},{"key":"10.1016\/0305-0548(85)90023-1_BIB10","series-title":"Recent Advances in Mathematical Programming","first-page":"269","article-title":"An algorithm for integer solutions to linear programs","author":"Gomory","year":"1963"},{"key":"10.1016\/0305-0548(85)90023-1_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":"Op Res."},{"key":"10.1016\/0305-0548(85)90023-1_BIB12","unstructured":"P. Sinha, Private communication (1981)."},{"key":"10.1016\/0305-0548(85)90023-1_BIB13","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(85)90023-1_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":"Op Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054885900231?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054885900231?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:52:09Z","timestamp":1552927929000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054885900231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["0305054885900231"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(85)90023-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}