{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:47:49Z","timestamp":1762429669799},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"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":3881,"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":[[2002,12]]},"DOI":"10.1016\/s0166-218x(01)00329-8","type":"journal-article","created":{"date-parts":[[2002,8,26]],"date-time":"2002-08-26T19:45:48Z","timestamp":1030391148000},"page":"55-65","source":"Crossref","is-referenced-by-count":24,"title":["Bounds for probabilistic integer programming problems"],"prefix":"10.1016","volume":"124","author":[{"given":"Darinka","family":"Dentcheva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Pr\u00e9kopa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Ruszczy\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00329-8_BIB1","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","article-title":"Branch-and-price: column generation for solving huge integer programs","volume":"46","author":"Barnhart","year":"1998","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00329-8_BIB2","series-title":"Gr\u00f6bner Bases","author":"Becker","year":"1993"},{"key":"10.1016\/S0166-218X(01)00329-8_BIB3","series-title":"Introduction to Stochastic Programming","author":"Birge","year":"1997"},{"key":"10.1016\/S0166-218X(01)00329-8_BIB4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1287\/mnsc.4.3.235","article-title":"Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil","volume":"4","author":"Charnes","year":"1958","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00329-8_BIB5","series-title":"Linear Programming","author":"Chv\u00e1tal","year":"1983"},{"key":"10.1016\/S0166-218X(01)00329-8_BIB6","doi-asserted-by":"crossref","unstructured":"D. Dentcheva, A. Pr\u00e9kopa, A. Ruszczy\u0144ski, Concavity and Efficient Points of Discrete Distributions in Probabilistic Programming, Math. Programming 89 (2000) 55\u201377.","DOI":"10.1007\/PL00011393"},{"key":"10.1016\/S0166-218X(01)00329-8_BIB7","series-title":"AMPL: A Modeling Language For Mathematical Programming","author":"Fourer","year":"1993"},{"key":"10.1016\/S0166-218X(01)00329-8_BIB8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(95)00050-X","article-title":"Stochastic vehicle routing","volume":"88","author":"Gendreau","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00329-8_BIB9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0377-2217(89)90354-8","article-title":"Models and exact solutions for a class of stochastic location-routing problems","volume":"39","author":"Laporte","year":"1989","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00329-8_BIB10","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1287\/opre.13.6.930","article-title":"Chance-constrained programming with joint constraints","volume":"13","author":"Miller","year":"1965","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00329-8_BIB11","doi-asserted-by":"crossref","unstructured":"A. Pr\u00e9kopa, On probabilistic constrained programming, Proceedings of the Princeton Symposium on Mathematical Programming, Princeton University Press, Princeton, 1970, pp. 113\u2013138.","DOI":"10.1515\/9781400869930-009"},{"key":"10.1016\/S0166-218X(01)00329-8_BIB12","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/BF01584661","article-title":"Contributions to the theory of stochastic programming","volume":"4","author":"Pr\u00e9kopa","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00329-8_BIB13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.36.1.145","article-title":"Boole\u2013Bonferroni inequalities and linear programming","volume":"36","author":"Pr\u00e9kopa","year":"1988","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00329-8_BIB14","first-page":"441","article-title":"Dual method for a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution","volume":"34","author":"Pr\u00e9kopa","year":"1990","journal-title":"Z. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00329-8_BIB15","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1287\/opre.38.2.227","article-title":"Sharp bounds on probabilities using linear programming","volume":"38","author":"Pr\u00e9kopa","year":"1990","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00329-8_BIB16","series-title":"Stochastic Programming","author":"Pr\u00e9kopa","year":"1995"},{"key":"10.1016\/S0166-218X(01)00329-8_BIB17","series-title":"New Trends in Mathematical Programming","first-page":"235","article-title":"Programming under probabilistic constraint with discrete random variable","author":"Pr\u00e9kopa","year":"1998"},{"key":"10.1016\/S0166-218X(01)00329-8_BIB18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0167-6377(92)90037-4","article-title":"Relaxations for the probabilistically constrained programs with discrete random variables","volume":"11","author":"Sen","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(01)00329-8_BIB19","unstructured":"B. Vizv\u00e1ri, Beitr\u00e4ge zum Frobenius Problem, D.Sc.Nat. Dissertation, Technische Hohschule Carl Schorlemmer, Leuna-Merseburg, Germany, 1987."},{"key":"10.1016\/S0166-218X(01)00329-8_BIB20","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF01585566","article-title":"An algebraic geometry algorithm for scheduling in the presence of setups and correlated demands","volume":"69","author":"Tayur","year":"1995","journal-title":"Math. Programming"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003298?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003298?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T01:30:39Z","timestamp":1578447039000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01003298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0166218X01003298"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00329-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}