{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:15:00Z","timestamp":1649186100713},"reference-count":18,"publisher":"Elsevier BV","issue":"1","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)90010-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"91-95","source":"Crossref","is-referenced-by-count":0,"title":["Solution approaches for highly primal- and dual-degenerate all-integer programming problems"],"prefix":"10.1016","volume":"12","author":[{"given":"Parviz","family":"Ghandforoush","sequence":"first","affiliation":[]},{"given":"Larry M.","family":"Austin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0305-0548(85)90010-3_BIB1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/nav.3800300110","article-title":"An advanced 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)90010-3_BIB2","unstructured":"L. M. Austin and P. Ghandforoush, A surrogate cutting plane algorithm for all-integer programming. To appear in Comput. Ops. Res."},{"issue":"2","key":"10.1016\/0305-0548(85)90010-3_BIB3","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)90010-3_BIB4","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","article-title":"A tree-search algorithm for mixed integer programming problems","volume":"8","author":"Dakin","year":"1965","journal-title":"Comput. J."},{"key":"10.1016\/0305-0548(85)90010-3_BIB5","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/0305-0548(85)90010-3_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0305-0548(85)90010-3_BIB7","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)90010-3_BIB8","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)90010-3_BIB9","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(85)90010-3_BIB10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1287\/mnsc.17.5.285","article-title":"An adaptive group theoretic algorithm for integer programming problems","volume":"17","author":"Gorry","year":"1971","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(85)90010-3_BIB11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/mnsc.18.5.229","article-title":"Relaxation methods for pure and mixed integer programming problems","volume":"18","author":"Gorry","year":"1972","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(85)90010-3_BIB12","series-title":"An all-integer cutting plane algorithm with an advanced start","author":"Hanna","year":"1981"},{"key":"10.1016\/0305-0548(85)90010-3_BIB13","unstructured":"M. E. Hanna and L. M. Austin, An advanced start algorithm for all-integer programming. To appear in Comput. Ops. Res."},{"key":"10.1016\/0305-0548(85)90010-3_BIB14","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","article-title":"An automatic method for solving discrete programming problems","volume":"28","author":"Land","year":"1960","journal-title":"Econometrica"},{"key":"10.1016\/0305-0548(85)90010-3_BIB15","series-title":"A bounded enumeration algorithm for all-integer programming","author":"Ruparel","year":"1981"},{"key":"10.1016\/0305-0548(85)90010-3_BIB16","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(85)90010-3_BIB17","article-title":"MESA: A heuristic integer linear programming technique","author":"Trauth","year":"1968","journal-title":"Sandia Laboratories Research Report SC-RR-68 299"},{"key":"10.1016\/0305-0548(85)90010-3_BIB18","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:0305054885900103?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054885900103?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:51:30Z","timestamp":1552927890000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054885900103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["0305054885900103"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(85)90010-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}