{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:59:30Z","timestamp":1720699170913},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,4,1]],"date-time":"1982-04-01T00:00:00Z","timestamp":386467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11430,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1982,4]]},"DOI":"10.1016\/0166-218x(82)90071-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"135-148","source":"Crossref","is-referenced-by-count":6,"title":["A finitely convergent procedure for facial disjunctive programs"],"prefix":"10.1016","volume":"4","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.M.","family":"Shetty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(82)90071-3_BIB1","series-title":"Management Science Research Report, No. 330","article-title":"Intersection cuts from disjunctive constraints","author":"Balas","year":"1974"},{"key":"10.1016\/0166-218X(82)90071-3_BIB2","series-title":"Non-Linear Programming","article-title":"Disjunctive programming: cutting planes from logical conditions","author":"Balas","year":"1975"},{"key":"10.1016\/0166-218X(82)90071-3_BIB3","series-title":"Management Science Research Report, No. 348","article-title":"Disjunctive programming: properties of the convex hull of feasible points","author":"Balas","year":"1974"},{"key":"10.1016\/0166-218X(82)90071-3_BIB4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00933212","article-title":"A converse for disjunctive programs","volume":"25","author":"Blair","year":"1979","journal-title":"J. Optimization Theory Appl."},{"key":"10.1016\/0166-218X(82)90071-3_BIB5","first-page":"181","article-title":"Polyhedral convexity cuts and negative edge extensions","volume":"18","author":"Glover","year":"1974","journal-title":"Z. Operations Res."},{"key":"10.1016\/0166-218X(82)90071-3_BIB6_1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01681342","article-title":"Polyhedral annexation in mixed integer and combinatorial programming","volume":"8","author":"Glover","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(82)90071-3_BIB6_2","first-page":"161","article-title":"Polyhedral annexation in mixed integer and combinatorial programming","volume":"8","author":"Glover","year":"1973"},{"key":"10.1016\/0166-218X(82)90071-3_BIB7","series-title":"Convex Polytopes","author":"Grunbaum","year":"1967"},{"key":"10.1016\/0166-218X(82)90071-3_BIB8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0167-5060(08)70741-6","article-title":"Cutting plane theory: disjunctive methods","volume":"1","author":"Jeroslow","year":"1977","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"10.1016\/0166-218X(82)90071-3_BIB9","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/0316005","article-title":"Cutting planes for complementary constraints","volume":"16","author":"Jeroslow","year":"1978","journal-title":"SIAM J. Control and Optimization"},{"key":"10.1016\/0166-218X(82)90071-3_BIB10","series-title":"Center for Operations Research and Econometrics","article-title":"A cutting plane-game and its algorithms","author":"Jeroslow","year":"1977"},{"key":"10.1016\/0166-218X(82)90071-3_BIB11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(74)90070-3","article-title":"Quasi-convex minimization subject to linear constraints","volume":"9","author":"Majthay","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(82)90071-3_BIB12","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/nav.3800270310","article-title":"On the generation of deep disjunctive cutting planes","volume":"27","author":"Sherali","year":"1980","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(82)90071-3_BIB13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01581626","article-title":"A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts","volume":"19","author":"Sherali","year":"1980","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(82)90071-3_BIB14","series-title":"Res. Rep. J-79-28","article-title":"Disjunctive programming, polyhedral annexation techniques, and nondominated disjunctive cutting planes","author":"Sherali","year":"1979"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X82900713?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X82900713?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:25:17Z","timestamp":1555122317000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X82900713"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,4]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,4]]}},"alternative-id":["0166218X82900713"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(82)90071-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1982,4]]}}}