default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrizia Beraldi
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Patrizia Beraldi, Luigi Gallo, Alessandra Rende:
A Learning Powered Bi-Level Approach for Dynamic Electricity Pricing. ICORES 2024: 390-397- 2023
- [j42]Antonio Violi
, Patrizia Beraldi, Gianluca Carrozzino:
Dealing with the stochastic prosumager problem with controllable loads. Soft Comput. 27(18): 12913-12924 (2023) - [j41]Patrizia Beraldi, Sara Khodaparasti:
A bi-level model for the design of dynamic electricity tariffs with demand-side flexibility. Soft Comput. 27(18): 12925-12942 (2023) - [c8]Mariacarmela Passarelli, G. Bongiorno, Patrizia Beraldi, Roberto Musmanno, Luigino Filice:
Supply chain management in case of producer disruption between external (instable) forces and effective models. ISM 2023: 1305-1315 - 2022
- [j40]Patrizia Beraldi, Maria Elena Bruni:
Enhanced indexation via chance constraints. Oper. Res. 22(2): 1553-1573 (2022) - 2021
- [j39]Patrizia Beraldi, Antonio Violi, Massimiliano Ferrara, Claudio Ciancio, Bruno Antonio Pansera:
Dealing with complex transaction costs in portfolio management. Ann. Oper. Res. 299(1): 7-22 (2021) - [j38]Patrizia Beraldi, Annarita De Maio, Demetrio Laganà, Antonio Violi:
A pick-up and delivery problem for logistics e-marketplace services. Optim. Lett. 15(5): 1565-1577 (2021) - 2020
- [j37]Maria Elena Bruni, Patrizia Beraldi, Sara Khodaparasti:
A hybrid reactive GRASP heuristic for the risk-averse k-traveling repairman problem with profits. Comput. Oper. Res. 115: 104854 (2020)
2010 – 2019
- 2019
- [j36]Patrizia Beraldi, Maurizio Boccia, Claudio Sterle:
Special issue on: Optimization methods for decision making: advances and applications. Soft Comput. 23(9): 2849-2852 (2019) - [j35]Patrizia Beraldi, Maria Elena Bruni, Demetrio Laganà, Roberto Musmanno:
The risk-averse traveling repairman problem with profits. Soft Comput. 23(9): 2979-2993 (2019) - [c7]Maria Elena Bruni, Sara Khodaparasti, Patrizia Beraldi:
A Selective Scheduling Problem with Sequence-dependent Setup Times: A Risk-averse Approach. ICORES 2019: 195-201 - [c6]Patrizia Beraldi, Antonio Violi, Maria Elena Bruni, Gianluca Carrozzino:
Dynamic Index Tracking via Stochastic Programming. ICORES 2019: 443-450 - [c5]Maria Elena Bruni, Lorenzo Brusco, Giuseppe Ielpa, Patrizia Beraldi:
The Risk-averse Profitable Tour Problem. ICORES 2019: 459-466 - 2018
- [j34]Patrizia Beraldi, Antonio Violi, Gianluca Carrozzino, Maria Elena Bruni:
A stochastic programming approach for the optimal management of aggregated distributed energy resources. Comput. Oper. Res. 96: 200-212 (2018) - [j33]Maria Elena Bruni, Luigi Di Puglia Pugliese, Patrizia Beraldi, Francesca Guerriero:
A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem. Comput. Oper. Res. 99: 178-190 (2018) - [j32]Maria Elena Bruni, Patrizia Beraldi, Sara Khodaparasti:
A heuristic Approach for the k-Traveling Repairman Problem with Profits under Uncertainty. Electron. Notes Discret. Math. 69: 221-228 (2018) - [c4]Maria Elena Bruni, Luigi Di Puglia Pugliese, Patrizia Beraldi, Francesca Guerriero:
A Two-stage Stochastic Programming Model for the Resource Constrained Project Scheduling Problem under Uncertainty. ICORES 2018: 194-200 - 2016
- [j31]Sara Khodaparasti, Hamid Reza Maleki, Maria Elena Bruni, Sedigheh Jahedi, Patrizia Beraldi, Domenico Conforti:
Balancing efficiency and equity in location-allocation models with an application to strategic EMS design. Optim. Lett. 10(5): 1053-1070 (2016) - 2015
- [j30]Patrizia Beraldi, Maria Elena Bruni, Demetrio Laganà, Roberto Musmanno:
The mixed capacitated general routing problem under uncertainty. Eur. J. Oper. Res. 240(2): 382-392 (2015) - 2014
- [j29]Chefi Triki, Simona Oprea, Patrizia Beraldi, Teodor Gabriel Crainic:
The stochastic bid generation problem in combinatorial transportation auctions. Eur. J. Oper. Res. 236(3): 991-999 (2014) - [j28]Patrizia Beraldi, Lucio Grandinetti, Italo Epicoco, Antonio Violi, Maria Elena Bruni:
An advanced system for portfolio optimisation. Int. J. Grid Util. Comput. 5(1): 21-32 (2014) - 2013
- [j27]Maria Elena Bruni, Patrizia Beraldi, Demetrio Laganà:
The Express heuristic for probabilistically constrained integer problems. J. Heuristics 19(3): 423-441 (2013) - 2012
- [j26]Patrizia Beraldi, Maria Elena Bruni, Antonio Violi:
Capital rationing problems under uncertainty and risk. Comput. Optim. Appl. 51(3): 1375-1396 (2012) - 2011
- [j25]Maria Elena Bruni, Patrizia Beraldi, Francesca Guerriero, Erika Pinto:
A heuristic approach for resource constrained project scheduling with uncertain activity durations. Comput. Oper. Res. 38(9): 1305-1318 (2011) - [j24]Patrizia Beraldi, Antonio Violi, Francesco De Simone:
A decision support system for strategic asset allocation. Decis. Support Syst. 51(3): 549-561 (2011) - [c3]Volodymyr Turchenko, Patrizia Beraldi, Francesco De Simone, Lucio Grandinetti:
Short-term stock price prediction using MLP in moving simulation mode. IDAACS (2) 2011: 666-671 - 2010
- [j23]Patrizia Beraldi, Maria Elena Bruni:
An exact approach for solving integer problems under probabilistic constraints with random technology matrix. Ann. Oper. Res. 177(1): 127-137 (2010) - [j22]Patrizia Beraldi, Gianpaolo Ghiani, Roberto Musmanno, Francesca Vocaturo:
Efficient Neighborhood Search for the Probabilistic Multi-Vehicle Pickup and Delivery Problem. Asia Pac. J. Oper. Res. 27(3): 301-314 (2010) - [j21]Patrizia Beraldi, Francesco De Simone, Antonio Violi:
Generating scenario trees: A parallel integrated simulation-optimization approach. J. Comput. Appl. Math. 233(9): 2322-2331 (2010)
2000 – 2009
- 2009
- [j20]Maria Elena Bruni, Patrizia Beraldi, Domenico Conforti:
A Solution Approach for Two-Stage Stochastic Nonlinear Mixed Integer Programs. Algorithmic Oper. Res. 4(1): 76-85 (2009) - [j19]Patrizia Beraldi, Maria Elena Bruni:
A probabilistic model applied to emergency service vehicle location. Eur. J. Oper. Res. 196(1): 323-331 (2009) - [j18]Patrizia Beraldi, Maria Elena Bruni, Domenico Conforti:
The stochastic trim-loss problem. Eur. J. Oper. Res. 197(1): 42-49 (2009) - 2008
- [j17]Francesca Guerriero, Patrizia Beraldi:
The alpha-reliable shortest path problem. Algorithmic Oper. Res. 3(1) (2008) - [j16]Patrizia Beraldi, Domenico Conforti, Antonio Violi:
A two-stage stochastic programming model for electric energy producers. Comput. Oper. Res. 35(10): 3360-3370 (2008) - [j15]Patrizia Beraldi, Gianpaolo Ghiani, Antonio Grieco, Emanuela Guerriero:
Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs. Comput. Oper. Res. 35(11): 3644-3656 (2008) - [c2]Patrizia Beraldi, Lucio Grandinetti, Antonio Violi, Italo Epicoco:
Grid Computing for Financial Applications. High Performance Computing Workshop 2008: 380-395 - 2006
- [j14]Patrizia Beraldi, Gianpaolo Ghiani, Antonio Grieco, Emanuela Guerriero:
Fix and Relax Heuristic for a Stochastic Lot-Sizing Problem. Comput. Optim. Appl. 33(2-3): 303-318 (2006) - 2005
- [j13]Chefi Triki, Patrizia Beraldi, George Gross:
Optimal capacity allocation in multi-auction electricity markets under uncertainty. Comput. Oper. Res. 32: 201-217 (2005) - [j12]Patrizia Beraldi, Andrzej Ruszczynski:
Beam search heuristic to solve stochastic integer problems under probabilistic constraints. Eur. J. Oper. Res. 167(1): 35-47 (2005) - [j11]Patrizia Beraldi, Gianpaolo Ghiani, Gilbert Laporte, Roberto Musmanno:
Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem. Networks 45(4): 195-198 (2005) - 2004
- [j10]Patrizia Beraldi, Domenico Conforti, Chefi Triki, Antonio Violi:
Constrained auction clearing in the Italian electricity market. 4OR 2(1): 35-51 (2004) - [j9]Patrizia Beraldi, Maria Elena Bruni, Domenico Conforti:
Designing robust emergency medical service via stochastic programming. Eur. J. Oper. Res. 158(1): 183-193 (2004) - 2003
- [j8]Andrea Attanasio, Patrizia Beraldi, Francesca Guerriero:
A Practical Performance Index for Comparing of Optimization Software. Int. J. Comput. 2(1): 7-12 (2003) - 2002
- [j7]Patrizia Beraldi, Andrzej Ruszczynski:
The Probabilistic Set-Covering Problem. Oper. Res. 50(6): 956-967 (2002) - [j6]Patrizia Beraldi, Andrzej Ruszczynski:
A branch and bound method for stochastic integer problems under probabilistic constraints. Optim. Methods Softw. 17(3): 359-382 (2002) - 2001
- [j5]Patrizia Beraldi, Francesca Guerriero, Roberto Musmanno:
Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem. Comput. Optim. Appl. 18(2): 175-190 (2001) - 2000
- [j4]Patrizia Beraldi, Roberto Musmanno, Chefi Triki:
Solving Stochastic Linear Programs with Restricted Recourse Using Interior Point Methods. Comput. Optim. Appl. 15(3): 215-234 (2000) - [j3]Patrizia Beraldi, Lucio Grandinetti, Roberto Musmanno, Chefi Triki:
Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints. Parallel Comput. 26(13-14): 1889-1908 (2000)
1990 – 1999
- 1999
- [j2]Giovanni Aloisio, Patrizia Beraldi, Massimo Cafaro, Francesca Guerriero, Roberto Musmanno:
An Algorithm for Solving the Distributed Termination Detection Problem. Parallel Algorithms Appl. 14(2): 149-164 (1999) - 1997
- [j1]Patrizia Beraldi, Francesca Guerriero:
A Parallel Asynchronous Implementation of the e-Relaxation Method for the Linear Minimum Cost Flow Problem. Parallel Comput. 23(8): 1021-1044 (1997) - [c1]Patrizia Beraldi, Lucio Grandinetti, Francesca Guerriero:
Solving Large-Scale Network Transportation Problems on a Cluster of Workstations. PARCO 1997: 97-104
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
