{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T04:56:46Z","timestamp":1778993806817,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"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":5342,"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":[[1998,12]]},"DOI":"10.1016\/s0166-218x(98)00136-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"3-44","source":"Crossref","is-referenced-by-count":245,"title":["Disjunctive programming: Properties of the convex hull of feasible points"],"prefix":"10.1016","volume":"89","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00136-X_BIB1","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/BF01584553","article-title":"Integer programming and convex analysis","volume":"2","author":"Balas","year":"1972","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(98)00136-X_BIB2","article-title":"Nonconvex quadratic programming via generalized polars. MSRR No. 278","author":"Balas","year":"1972"},{"key":"10.1016\/S0166-218X(98)00136-X_BIB17","unstructured":"Forthcoming in the SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(98)00136-X_BIB3","series-title":"Paper presented at the 8th Internat. Symp. on Mathematical Programming","article-title":"On the use of intersection cuts in branch and bound","author":"Balas","year":"1973"},{"key":"10.1016\/S0166-218X(98)00136-X_BIB4","unstructured":"E. Balas, Intersection cuts from disjunctive constraints, MSRR No. 330, Carnegie-Mellon University. First draft August 1973, revised and expanded February 1974."},{"key":"10.1016\/S0166-218X(98)00136-X_BIB5","series-title":"Paper presented at the SIGMAP - University of Wisconsin Nonlinear Programming Symp.","article-title":"Cutting planes from logical conditions","author":"Balas","year":"1974"},{"key":"10.1016\/S0166-218X(98)00136-X_BIB6","series-title":"Theory of Linear Economic Models","author":"Gale","year":"1960"},{"key":"10.1016\/S0166-218X(98)00136-X_BIB7","article-title":"Polyhedral annexation in mixed integer programming, MSRR No. 73-9","author":"Glover","year":"1973"},{"key":"10.1016\/S0166-218X(98)00136-X_BIB8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/opre.21.1.141","article-title":"The generalized lattice point problem","volume":"21","author":"Glover","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(98)00136-X_BIB9","doi-asserted-by":"crossref","DOI":"10.1007\/BF00934097","article-title":"Improved Convexity Cuts for Lattice Point Problems","author":"Glover","year":"1973"},{"key":"10.1016\/S0166-218X(98)00136-X_BIB10","series-title":"Convex Polytopes","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/S0166-218X(98)00136-X_BIB11","doi-asserted-by":"crossref","unstructured":"R.G. Jeroslow, Personal communication, March 1974.","DOI":"10.1016\/0012-365X(74)90038-7"},{"key":"10.1016\/S0166-218X(98)00136-X_BIB12","series-title":"Principles of Cutting Plane Theory: Part I","author":"Jeroslow","year":"1974"},{"key":"10.1016\/S0166-218X(98)00136-X_BIB13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF00934290","article-title":"Cutting planes for programs with disjunctive constraints","volume":"11","author":"Owen","year":"1973","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0166-218X(98)00136-X_BIB14","series-title":"Convex Analysis","author":"Rockafellar","year":"1970"},{"key":"10.1016\/S0166-218X(98)00136-X_BIB15","series-title":"Convexity and Optimization in Finite Dimensions. I","author":"Stoer","year":"1970"},{"key":"10.1016\/S0166-218X(98)00136-X_BIB16","series-title":"Intersection cuts for separable programming","author":"Zwart","year":"1972"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9800136X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9800136X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:50:23Z","timestamp":1555984223000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X9800136X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0166218X9800136X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00136-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}