default search action
Pierre Fouilhoux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i6]Alexandre Dupont-Bouillard, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix:
Contractions in perfect graph. CoRR abs/2401.12793 (2024) - [i5]Pierre Fouilhoux, Lucas Létocart, Yue Zhang:
A generic Branch-and-Cut algorithm for bi-objective binary linear programs. CoRR abs/2410.08722 (2024) - 2023
- [j21]Pascale Bendotti
, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau
The Anchor-Robust Project Scheduling Problem. Oper. Res. 71(6): 2267-2290 (2023) - 2022
- [j20]Anne-Elisabeth Falq
Dominance inequalities for scheduling around an unrestrictive common due date. Eur. J. Oper. Res. 296(2): 453-464 (2022) - 2021
- [j19]Anne-Elisabeth Falq, Pierre Fouilhoux, Safia Kedad-Sidhoum:
Mixed integer formulations using natural variables for single machine scheduling around a common due date. Discret. Appl. Math. 290: 36-59 (2021) - [j18]Pascale Bendotti
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem. Eur. J. Oper. Res. 295(1): 22-33 (2021) - [j17]Pascale Bendotti
Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem. Math. Program. 186(1): 337-372 (2021) - [i4]Anne-Elisabeth Falq, Pierre Fouilhoux, Safia Kedad-Sidhoum:
Dominance inequalities for scheduling around an unrestrictive common due date. CoRR abs/2102.07382 (2021) - [i3]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
- [j16]Pascale Bendotti
Symmetry-breaking inequalities for ILP with structured sub-symmetry. Math. Program. 183(1): 61-103 (2020) - [c4]Pascale Bendotti
Anchored Rescheduling Problems Under Generalized Precedence Constraints. ISCO 2020: 156-166
2010 – 2019
- 2019
- [j15]Pascale Bendotti
On the complexity of the Unit Commitment Problem. Ann. Oper. Res. 274(1-2): 119-130 (2019) - [c3]Pascale Bendotti
Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry. IPCO 2019: 57-71 - [i2]Anne-Elisabeth Falq, Pierre Fouilhoux, Safia Kedad-Sidhoum:
Mixed integer formulations using natural variables for single machine scheduling around a common due date. CoRR abs/1901.06880 (2019) - 2018
- [j14]Pascale Bendotti
The Unit-capacity Constrained Permutation Problem. Eur. J. Oper. Res. 268(2): 463-472 (2018) - [j13]Pascale Bendotti
The min-up/min-down unit commitment polytope. J. Comb. Optim. 36(3): 1024-1058 (2018) - [j12]Pierre Fouilhoux
Branch-and-Cut-and-Price algorithms for the preemptive RCPSP. RAIRO Oper. Res. 52(2): 513 (2018) - 2017
- [j11]Pascale Bendotti
Anchored reactive and proactive solutions to the CPM-scheduling problem. Eur. J. Oper. Res. 261(1): 67-74 (2017) - [c2]Marco Casazza
Securing virtual network function placement with high availability guarantees. Networking 2017: 1-9 - [i1]Marco Casazza, Pierre Fouilhoux, Mathieu Bouet, Stefano Secci:
Securing Virtual Network Function Placement with High Availability Guarantees. CoRR abs/1701.07993 (2017) - 2016
- [j10]Pascale Bendotti
Feasibility recovery for the Unit-capacity Constrained Permutation Problem. Discret. Optim. 22: 66-86 (2016) - [j9]Pierre Fouilhoux, Omar Jorge Ibarra-Rojas, Safia Kedad-Sidhoum, Yasmín Á. Ríos-Solís
Valid inequalities for the synchronization bus timetabling problem. Eur. J. Oper. Res. 251(2): 442-450 (2016) - 2015
- [j8]Sylvie Borne, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix
Circuit and bond polytopes on series-parallel graphs. Discret. Optim. 17: 55-68 (2015) - 2014
- [j7]Philippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura:
The location-dispatching problem: Polyhedral results and content delivery network design. Discret. Appl. Math. 164: 68-85 (2014) - [j6]Pierre Fouilhoux, Aurélien Questel:
A branch-and-cut for the Non-Disjoint m-Ring-Star Problem. RAIRO Oper. Res. 48(2): 167-188 (2014) - [e1]Pierre Fouilhoux, Luis Eduardo Neves Gouveia, Ali Ridha Mahjoub, Vangelis Th. Paschos:
Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8596, Springer 2014, ISBN 978-3-319-09173-0 [contents] - 2012
- [j5]Pierre Fouilhoux, Ali Ridha Mahjoub:
Solving VLSI design and DNA sequencing problems using bipartization of graphs. Comput. Optim. Appl. 51(2): 749-781 (2012) - [j4]Pierre Fouilhoux, Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman
Survivability in hierarchical telecommunications networks. Networks 59(1): 37-58 (2012) - [c1]Pierre Fouilhoux, Aurélien Questel:
The Non-Disjoint m-Ring-Star Problem: Polyhedral Results and SDH/SONET Network Design. ISCO 2012: 93-104 - 2010
- [j3]Philippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura:
The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design. Electron. Notes Discret. Math. 36: 867-874 (2010)
2000 – 2009
- 2009
- [j2]Pierre Fouilhoux, Martine Labbé
Generating Facets for the Independence System Polytope. SIAM J. Discret. Math. 23(3): 1484-1506 (2009) - 2006
- [j1]Pierre Fouilhoux, Ali Ridha Mahjoub:
Polyhedral results for the bipartite induced subgraph problem. Discret. Appl. Math. 154(15): 2128-2149 (2006)
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-11-19 20:48 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: