default search action
Boris Defourny
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j10]Yuhai Hu, Boris Defourny
:
Optimal price-threshold control for battery operation with aging phenomenon: a quasiconvex optimization approach. Ann. Oper. Res. 317(2): 623-650 (2022) - 2021
- [j9]Felix Prause
The maximum diversity assortment selection problem. Math. Methods Oper. Res. 93(3): 521-554 (2021) - 2020
- [j8]Somayeh Moazeni
Sequential Learning in Designing Marketing Campaigns for Market Entry. Manag. Sci. 66(9): 4226-4245 (2020)
2010 – 2019
- 2019
- [j7]Shu Tu, Boris Defourny
An active-set strategy to solve Markov decision processes with good-deal risk measure. Optim. Lett. 13(6): 1239-1257 (2019) - 2018
- [j6]Boris Defourny
Optimality of an affine intensity policy for maximizing the probability of an arrival count in point-process intensity control. Oper. Res. Lett. 46(1): 51-55 (2018) - 2017
- [j5]Somayeh Moazeni, Warren B. Powell, Boris Defourny
Parallel Nonstationary Direct Policy Search for Risk-Averse Stochastic Optimization. INFORMS J. Comput. 29(2): 332-349 (2017) - 2016
- [j4]Bin Han, Ilya O. Ryzhov, Boris Defourny
Optimal Learning in Linear Regression with Combinatorial Feature Selection. INFORMS J. Comput. 28(4): 721-735 (2016) - 2015
- [j3]Boris Defourny
Optimal Information Blending with Measurements in the L2 Sphere. Math. Oper. Res. 40(4): 1060-1088 (2015) - 2014
- [c9]Yuhai Hu, Boris Defourny
Near-optimality bounds for greedy periodic policies with application to grid-level storage. ADPRL 2014: 1-8 - 2013
- [j2]Boris Defourny
Scenario Trees and Policy Selection for Multistage Stochastic Programming Using Machine Learning. INFORMS J. Comput. 25(3): 488-501 (2013) - [j1]Hugo P. Simão, H. B. Jeong, Boris Defourny
A Robust Solution to the Load Curtailment Problem. IEEE Trans. Smart Grid 4(4): 2209-2219 (2013) - [c8]Donghun Lee
Bias-corrected Q-learning to control max-operator bias in Q-learning. ADPRL 2013: 93-99 - [c7]Boris Defourny
Robust Forecasting for Unit Commitment with Wind. HICSS 2013: 2337-2344 - [c6]Bin Han, Ilya O. Ryzhov, Boris Defourny
Efficient learning of donor retention strategies for the American Red Cross. WSC 2013: 17-28 - 2012
- [c5]Ilya O. Ryzhov, Boris Defourny
Ranking and selection meets robust optimization. WSC 2012: 48:1-48:11 - 2010
- [b1]Boris Defourny:
Machine Learning Solution Methods for Multistage Stochastic Programming. University of Liège, Belgium, 2010
2000 – 2009
- 2009
- [c4]Boris Defourny
Planning under uncertainty, ensembles of disturbance trees and kernelized discrete action spaces. ADPRL 2009: 145-152 - [c3]Sourour Ammar
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks. ECSQARU 2009: 156-167 - [c2]Boris Defourny
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies. SAGA 2009: 61-73 - 2008
- [c1]Boris Defourny
Lazy Planning under Uncertainty by Optimizing Decisions on an Ensemble of Incomplete Disturbance Trees. EWRL 2008: 1-14
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-04-25 05:58 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: