{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T03:45:50Z","timestamp":1774496750888,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0167-6377(92)90037-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"81-86","source":"Crossref","is-referenced-by-count":55,"title":["Relaxations for probabilistically constrained programs with discrete random variables"],"prefix":"10.1016","volume":"11","author":[{"given":"Suvrajeet","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90037-4_BIB1","series-title":"Nonlinear Programming 2","first-page":"279","article-title":"Disjunctive programming: cutting planes from logical conditions","author":"Balas","year":"1975"},{"key":"10.1016\/0167-6377(92)90037-4_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","article-title":"Disjunctive programming","volume":"5","author":"Balas","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0167-6377(92)90037-4_BIB3","series-title":"Nonlinear Programming: Theory and Algorithms","author":"Bazaraa","year":"1979"},{"key":"10.1016\/0167-6377(92)90037-4_BIB4","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BFb0121114","article-title":"Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse","volume":"27","author":"Birge","year":"1986","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0167-6377(92)90037-4_BIB5","series-title":"Discrete Location Theory","first-page":"119","article-title":"The uncapacitatd location problem","author":"Cornuejols","year":"1990"},{"key":"10.1016\/0167-6377(92)90037-4_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"Lagrangean relaxation method for solving integer programming","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(92)90037-4_BIB7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1287\/opre.21.1.123","article-title":"Convexity cuts and cut search","volume":"21","author":"Glover","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(92)90037-4_BIB8","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\/0167-6377(92)90037-4_BIB9","series-title":"Discrete Location Theory","first-page":"209","article-title":"Decomposition methods for facility location problem","author":"Magnanti","year":"1990"},{"key":"10.1016\/0167-6377(92)90037-4_BIB10","first-page":"301","article-title":"Logarithmic concave measures with applications to stochastic programming","volume":"32","author":"Prekopa","year":"1971","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"10.1016\/0167-6377(92)90037-4_BIB11","series-title":"Numerical Techniques for Stochastic Optimization","first-page":"123","article-title":"Numerical solution of probabilistic constrained programming problems","author":"Prekopa","year":"1988"},{"key":"10.1016\/0167-6377(92)90037-4_BIB12","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01580881","article-title":"A class of convergent primal-dual subgradient algorithms for decomposable convex programs","volume":"35","author":"Sen","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90037-4_BIB13","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/BF01582164","article-title":"Facet inequalities from simple disjunctions in cutting plane theory","volume":"34","author":"Sen","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90037-4_BIB14","series-title":"Optimization with Disjunctive Constraints","author":"Sherali","year":"1980"},{"key":"10.1016\/0167-6377(92)90037-4_BIB15","series-title":"Mathematical Programming: The State of the Art, 1982","first-page":"566","article-title":"Stochastic programming: solution techniques and approximation schemes","author":"Wets","year":"1982"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900374?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900374?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:27:59Z","timestamp":1552901279000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637792900374"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["0167637792900374"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90037-4","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}