default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPascale Bendotti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Adèle Pass-Lanneau
, Pascale Bendotti, Luca Brunod-Indrigo:
Exact and heuristic methods for Anchor-Robust and Adjustable-Robust RCPSP. Ann. Oper. Res. 337(2): 649-682 (2024)- [j15]Alexandre Heintzmann, Christian Artigues, Pascale Bendotti, Sandra Ulrich Ngueveu, Cécile Rottner:
A comparison of alternative models for solving a non-linear single plant Hydro Unit Commitment problem. Comput. Oper. Res. 165: 106591 (2024) - [j14]Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier:
Anchored rescheduling problem with non-availability periods. Oper. Res. Lett. 57: 107201 (2024) - [j13]Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier:
Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems. J. Sched. 27(6): 587-606 (2024) - [i2]Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier:
Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems. CoRR abs/2406.08104 (2024) - 2023
- [j12]Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau:
The Anchor-Robust Project Scheduling Problem. Oper. Res. 71(6): 2267-2290 (2023) - [c5]Alexandre Heintzmann, Christian Artigues, Pascale Bendotti, Sandra Ulrich Ngueveu, Cécile Rottner:
Efficient exact A* algorithm for the single unit hydro unit commitment problem. FedCSIS 2023: 533-543 - 2022
- [j11]Rodolphe Griset, Pascale Bendotti, Boris Detienne, Marc Porcheron, Halil Sen, François Vanderbeck:
Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem. Eur. J. Oper. Res. 298(3): 1067-1083 (2022) - 2021
- [j10]Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau:
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem. Eur. J. Oper. Res. 295(1): 22-33 (2021) - [j9]Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner:
Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem. Math. Program. 186(1): 337-372 (2021) - [i1]Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau:
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem. CoRR abs/2106.12055 (2021) - 2020
- [j8]Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner:
Symmetry-breaking inequalities for ILP with structured sub-symmetry. Math. Program. 183(1): 61-103 (2020) - [c4]Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau:
Anchored Rescheduling Problems Under Generalized Precedence Constraints. ISCO 2020: 156-166
2010 – 2019
- 2019
- [b1]Pascale Bendotti:
Contrôle de Systèmes Dynamiques Incertains et Résolution Exacte en Optimisation Combinatoire : Contributions et Applications. (Control of Uncertain Dynamical Systems and Exact Resolution in Combinatorial Optimization :Contributions et Applications). Sorbonne University, Paris, France, 2019 - [j7]Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner:
On the complexity of the Unit Commitment Problem. Ann. Oper. Res. 274(1-2): 119-130 (2019) - [c3]Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner:
Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry. IPCO 2019: 57-71 - 2018
- [j6]Pascale Bendotti, Pierre Fouilhoux, Safia Kedad-Sidhoum:
The Unit-capacity Constrained Permutation Problem. Eur. J. Oper. Res. 268(2): 463-472 (2018) - [j5]Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner:
The min-up/min-down unit commitment polytope. J. Comb. Optim. 36(3): 1024-1058 (2018) - 2017
- [j4]Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Alain Quilliot:
Anchored reactive and proactive solutions to the CPM-scheduling problem. Eur. J. Oper. Res. 261(1): 67-74 (2017) - 2016
- [j3]Pascale Bendotti, Pierre Fouilhoux:
Feasibility recovery for the Unit-capacity Constrained Permutation Problem. Discret. Optim. 22: 66-86 (2016)
2000 – 2009
- 2003
- [c2]Jean Thomas, Didier Dumur, Jean Buisson, Clément-Marc Falinower, Pascale Bendotti:
Moving horizon state estimation of hybrid systems. Application to fault detection of sensors of a steam generator. CCA 2003: 1375-1380 - 2000
- [j2]Mayuresh V. Kothare, Bernard Mettler, Manfred Morari, Pascale Bendotti, Clément-Marc Falinower:
Level control in the steam generator of a nuclear power plant. IEEE Trans. Control. Syst. Technol. 8(1): 55-69 (2000) - [c1]Christophe Prieur, Pascale Bendotti, Laurent El Ghaoui:
Robust optimization-based control: an LMI approach. CDC 2000: 2317-2322
1990 – 1999
- 1999
- [j1]Pascale Bendotti, Carolyn L. Beck:
On the role of LFT model reduction methods in robust controller synthesis for a pressurized water reactor. IEEE Trans. Control. Syst. Technol. 7(2): 248-257 (1999)
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-12-23 20:30 CET 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:
