![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Bernardo K. Pagnoncelli
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Patricio Lamas, Marcos Goycoolea
, Bernardo K. Pagnoncelli, Alexandra M. Newman
:
A target-time-windows technique for project scheduling under uncertainty. Eur. J. Oper. Res. 314(2): 792-806 (2024) - [j18]Tomás Gutierrez, Davi Valladão, Bernardo K. Pagnoncelli:
PolieDRO: a novel classification and regression framework with non-parametric data-driven regularization. Mach. Learn. 113(8): 5807-5846 (2024) - 2023
- [j17]Hamed Rahimian
, Bernardo K. Pagnoncelli:
Data-Driven Approximation of Contextual Chance-Constrained Stochastic Programs. SIAM J. Optim. 33(3): 2248-2274 (2023) - 2022
- [j16]Adriana Piazza, Bernardo K. Pagnoncelli
, Lewis Ntaimo
:
What is the optimal cutoff surface for ore bodies with more than one mineral? Oper. Res. Lett. 50(2): 137-144 (2022) - [c1]Gregory Keslin, Barry L. Nelson, Matthew Plumlee, Bernardo K. Pagnoncelli, Hamed Rahimian:
A Classification Method for Ranking and Selection with Covariates. WSC 2022: 1-12 - 2021
- [j15]Peter Nesbitt, Lewis R. Blake, Patricio Lamas
, Marcos Goycoolea
, Bernardo K. Pagnoncelli, Alexandra M. Newman
, Andrea J. Brickey:
Underground mine scheduling under uncertainty. Eur. J. Oper. Res. 294(1): 340-352 (2021) - [j14]Marcos Goycoolea, Patricio Lamas
, Bernardo K. Pagnoncelli
, Adriana Piazza:
Lane's Algorithm Revisited. Manag. Sci. 67(5): 3087-3103 (2021) - 2020
- [j13]Sebastián Arpón, Tito Homem-de-Mello
, Bernardo K. Pagnoncelli:
An ADMM algorithm for two-stage stochastic programming problems. Ann. Oper. Res. 286(1): 559-582 (2020) - [j12]Oscar Dowson, David P. Morton, Bernardo K. Pagnoncelli:
Partially observable multistage stochastic programming. Oper. Res. Lett. 48(4): 505-512 (2020)
2010 – 2019
- 2019
- [j11]Gianpiero Canessa
, Julian A. Gallego, Lewis Ntaimo, Bernardo K. Pagnoncelli:
An algorithm for binary linear chance-constrained problems using IIS. Comput. Optim. Appl. 72(3): 589-608 (2019) - [j10]Hélène Le Cadre, Bernardo K. Pagnoncelli, Tito Homem-de-Mello
, Olivier Beaude:
Designing coalition-based fair and stable pricing mechanisms under private information on consumers' reservation prices. Eur. J. Oper. Res. 272(1): 270-291 (2019) - 2018
- [j9]Sebastián Arpón, Tito Homem-de-Mello
, Bernardo K. Pagnoncelli:
Scenario reduction for stochastic programs with Conditional Value-at-Risk. Math. Program. 170(1): 327-356 (2018) - 2017
- [j8]Bernardo K. Pagnoncelli, Adriana Piazza:
The optimal harvesting problem under price uncertainty: the risk averse case. Ann. Oper. Res. 258(2): 479-502 (2017) - [j7]Masato Wada, Felipe Delgado
, Bernardo K. Pagnoncelli:
A risk averse approach to the capacity allocation problem in the airline cargo industry. J. Oper. Res. Soc. 68(6): 643-651 (2017) - 2016
- [j6]Tito Homem-de-Mello
, Bernardo K. Pagnoncelli:
Risk aversion in multistage stochastic programming: A modeling and algorithmic perspective. Eur. J. Oper. Res. 249(1): 188-199 (2016) - [j5]Javiera Barrera
, Tito Homem-de-Mello
, Eduardo Moreno
, Bernardo K. Pagnoncelli, Gianpiero Canessa
:
Chance-constrained problems and rare events: an importance sampling approach. Math. Program. 157(1): 153-189 (2016) - 2014
- [j4]Adriana Piazza, Bernardo K. Pagnoncelli:
The optimal harvesting problem under price uncertainty. Ann. Oper. Res. 217(1): 425-445 (2014) - 2012
- [j3]Bernardo K. Pagnoncelli, Steven Vanduffel
:
A provisioning problem with stochastic payments. Eur. J. Oper. Res. 221(2): 445-453 (2012) - [j2]Bernardo K. Pagnoncelli, Daniel Reich
, Marco C. Campi:
Risk-Return Trade-off with the Scenario Approach in Practice: A Case Study in Portfolio Selection. J. Optim. Theory Appl. 155(2): 707-722 (2012)
2000 – 2009
- 2009
- [j1]Bernardo K. Pagnoncelli, Shabbir Ahmed
, Alexander Shapiro:
Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications. J. Optimization Theory and Applications 142(2): 399-416 (2009)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-19 21:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint