Patrizia Beraldi

Prof. Patrizia Beraldi


Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2009 in European Journal of Operational Research
Verified
Journal Article
Closed access
PBPatrizia Beraldi
Patrizia Beraldi
MBM.E. Bruni
M.E. Bruni

1 October 2004 in European Journal of Operational Research
Verified
Journal Article
Closed access
PBPatrizia Beraldi
Patrizia Beraldi
MBM.E. Bruni
M.E. Bruni
DCDomenico Conforti
Domenico Conforti

1 December 2002 in Operations Research
Verified
Journal Article
Closed access
PBPatrizia Beraldi
Patrizia Beraldi
ARAndrzej Ruszczyński
Andrzej Ruszczyński
In a probabilistic set-covering problem the right-hand side is a random binary vector and the covering constraint has to be satisfied with some prescribed probability. We analyze the structure of the set of probabilistically efficient points of binary random vectors, develop methods for their enumeration, and propose specialized branch-and-bound algorithms for probabilistic set-covering problems.

1 November 2008 in Computers & Operations Research
Verified
Journal Article
Closed access
PBPatrizia Beraldi
Patrizia Beraldi
GGGianpaolo Ghiani
Gianpaolo Ghiani
AGAntonio Grieco
Antonio Grieco
EGEmanuela Guerriero
Emanuela Guerriero

1 January 2002 in Optimization Methods and Software
Verified
Journal Article
Closed access
PBPatrizia Beraldi
Patrizia Beraldi
ARAndrzej Ruszczyński
Andrzej Ruszczyński
Stochastic integer programming problems under probabilistic constraints are considered. Deterministic equivalent formulations of the original problem are obtained by using p-efficient points of the distribution function of the right hand side vector. A branch and bound solution method is proposed based on a partial enumeration of the set of these points. The numerical experience with the probabilistic lot-sizing problem shows the potential of the solution approach and the efficiency of the algorithms implemented.

1 August 2014 in European Journal of Operational Research
Verified
Journal Article
Closed access
CTChefi Triki
Chefi Triki
SOSimona Oprea
Simona Oprea
PBPatrizia Beraldi
Patrizia Beraldi
TCTeodor Gabriel Crainic
Teodor Gabriel Crainic