András Prékopa
Affiliations:- Rutgers University, USA
According to our database1,
András Prékopa
authored at least 50 papers
between 1972 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2022
Logical analysis of data: Estimation of cause-effect relationship under noise with applications in classification of natural water springs.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022
2021
Ann. Oper. Res., 2021
2020
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020
2018
2017
New bounds for the probability that at least k-out-of-n events occur with unimodal distributions.
Discret. Appl. Math., 2017
Extreme value estimation for a function of a random sample using binomial moments scheme and Boolean functions of events.
Discret. Appl. Math., 2017
2016
Improved bounds on the probability of the union of events some of whose intersections are empty.
Oper. Res. Lett., 2016
Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints.
Math. Oper. Res., 2016
The Discrete Moment Method for the numerical integration of piecewise higher order convex functions.
Discret. Appl. Math., 2016
On the relationship between the discrete and continuous bounding moment problems and their numerical solutions.
Ann. Oper. Res., 2016
2015
Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables.
Oper. Res., 2015
Decision-making from a risk assessment perspective for Corporate Mergers and Acquisitions.
Comput. Manag. Sci., 2015
Optimal capacity design under k-out-of-n and consecutive k-out-of-n type probabilistic constraints.
Ann. Oper. Res., 2015
2013
Log-concavity of compound distributions with applications in stochastic optimization.
Discret. Appl. Math., 2013
Ann. Oper. Res., 2013
2012
Ann. Oper. Res., 2012
2011
Oper. Res. Lett., 2011
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Discret. Appl. Math., 2009
2007
Monge Property and Bounding Multivariate Probability Distribution Functions with Given Marginals and Covariances.
SIAM J. Optim., 2007
2006
2005
Bounding the probability of the union of events by aggregation and disaggregation in linear programs.
Discret. Appl. Math., 2005
2004
A stochastic programming model to find optimal sample sizes to estimate unknown parameters in an LP.
Oper. Res. Lett., 2004
On Multivariate Discrete Moment Problems and Their Applications to Bounding Expectations and Probabilities.
Math. Oper. Res., 2004
2002
On a dual method for a specially structured linear programming problem with application to stochastic programming.
Optim. Methods Softw., 2002
2001
Oper. Res. Lett., 2001
2000
Concavity and efficient points of discrete distributions in probabilistic programming.
Math. Program., 2000
1999
The use of discrete moment bounds in probabilisticconstrained stochastic programming models.
Ann. Oper. Res., 1999
1995
Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function.
Math. Program., 1995
1991
Oper. Res., 1991
1990
Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution.
ZOR Methods Model. Oper. Res., 1990
1989
Closed Form Two-Sided Bounds for Probabilities that At Least <i>r</i> and Exactly <i>r</i> Out of <i>n</i> Events Occur.
Math. Oper. Res., 1989
Proceedings of the Reliability Of Computer And Communication Networks, 1989
1988
1973
1972