default search action
Pierre Carpentier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Tristan Rigaut, Pierre Carpentier, Jean-Philippe Chancelier, Michel De Lara:
Decomposition methods for monotone two-time-scale stochastic optimization problems. Comput. Manag. Sci. 21(1): 28 (2024) - [j13]Pierre Carpentier, Jean-Philippe Chancelier, Michel De Lara:
Time Consistency for Multistage Stochastic Optimization Problems under Constraints in Expectation. SIAM J. Optim. 34(2): 1909-1936 (2024) - 2022
- [j12]Thomas Bittar, Pierre Carpentier, Jean-Philippe Chancelier, Jérôme Lonchampt:
A decomposition method by interaction prediction for the optimization of maintenance scheduling. Ann. Oper. Res. 316(1): 229-267 (2022) - [j11]Cyrille Vessaire, Jean-Philippe Chancelier, Michel De Lara, Pierre Carpentier, Alejandro Rodríguez-Martínez, Anna Robert:
Multistage optimization of a petroleum production system with material balance model. Comput. Chem. Eng. 167: 108005 (2022) - [j10]Thomas Bittar, Pierre Carpentier, Jean-Philippe Chancelier, Jérôme Lonchampt:
The Stochastic Auxiliary Problem Principle in Banach Spaces: Measurability and Convergence. SIAM J. Optim. 32(3): 1871-1900 (2022) - 2020
- [j9]Pierre Carpentier, Jean-Philippe Chancelier, Michel De Lara, François Pacaud:
Mixed Spatial and Temporal Decompositions for Large-Scale Multistage Stochastic Optimization Problems. J. Optim. Theory Appl. 186(3): 985-1005 (2020) - [j8]Vincent Leclère, Pierre Carpentier, Jean-Philippe Chancelier, Arnaud Lenoir, François Pacaud:
Exact Converging Bounds for Stochastic Dual Dynamic Programming via Fenchel Duality. SIAM J. Optim. 30(2): 1223-1250 (2020)
2010 – 2019
- 2018
- [j7]Pierre Carpentier, Jean-Philippe Chancelier, Vincent Leclère, François Pacaud:
Stochastic decomposition applied to large-scale hydro valleys management. Eur. J. Oper. Res. 270(3): 1086-1098 (2018) - 2013
- [j6]Pierre Carpentier, Guy Cohen, Anes Dallagi:
Particle methods for stochastic optimal control problems. Comput. Optim. Appl. 56(3): 635-674 (2013) - 2012
- [j5]Pierre Carpentier, Jean-Philippe Chancelier, Guy Cohen, Michel De Lara, Pierre Girardeau:
Dynamic consistency for stochastic optimal control problems. Ann. Oper. Res. 200(1): 247-263 (2012) - 2010
- [j4]Kengy Barty, Pierre Carpentier, Pierre Girardeau:
Decomposition of large-scale stochastic optimal control problems. RAIRO Oper. Res. 44(3): 167-183 (2010)
2000 – 2009
- 2009
- [j3]Pierre Carpentier, Jean-Philippe Chancelier, Michel De Lara:
Approximations of Stochastic Optimization Problems Subject to Measurability Constraints. SIAM J. Optim. 19(4): 1719-1734 (2009) - 2006
- [j2]Kengy Barty, Jean-Philippe Chancelier, Guy Cohen, Michel De Lara, Thérèse Guilbaud, Pierre Carpentier:
Dual effect free stochastic controls. Ann. Oper. Res. 142(1): 41-62 (2006)
1990 – 1999
- 1993
- [j1]Pierre Carpentier, Guy Cohen:
Applied mathematics in water supply network management. Autom. 29(5): 1215-1250 (1993)
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-06-19 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint