Polyhedral results for the bipartite induced subgraph problem. - Pierre Fouilhoux; Ali Ridha Mahjoub (Discret. Appl. Math., 2006)

Generating Facets for the Independence System Polytope. - Pierre Fouilhoux; Martine Labbé; Ali Ridha Mahjoub; Hande Yaman (SIAM J. Discret. Math., 2009)

The Non-Disjoint m-Ring-Star Problem: Polyhedral Results and SDH/SONET Network Design. - Pierre Fouilhoux; Aurélien Questel (ISCO, 2012)

Solving VLSI design and DNA sequencing problems using bipartization of graphs. - Pierre Fouilhoux; Ali Ridha Mahjoub (Comput. Optim. Appl., 2012)

Survivability in hierarchical telecommunications networks. - Pierre Fouilhoux; Oya Ekin Karasan; Ali Ridha Mahjoub; Onur Özkök; Hande Yaman (Networks, 2012)

The location-dispatching problem: Polyhedral results and content delivery network design. - Philippe Chrétienne; Pierre Fouilhoux; Éric Gourdin; Jean-Mathieu Segura (Discret. Appl. Math., 2014)

A branch-and-cut for the Non-Disjoint m-Ring-Star Problem. - Pierre Fouilhoux; Aurélien Questel (RAIRO Oper. Res., 2014)

Circuit and bond polytopes on series-parallel graphs. - Sylvie Borne; Pierre Fouilhoux; Roland Grappe; Mathieu Lacroix 001; Pierre Pesneau (Discret. Optim., 2015)

Feasibility recovery for the Unit-capacity Constrained Permutation Problem. - Pascale Bendotti; Pierre Fouilhoux (Discret. Optim., 2016)

Valid inequalities for the synchronization bus timetabling problem. - Pierre Fouilhoux; Omar Jorge Ibarra-Rojas; Safia Kedad-Sidhoum; Yasmín Á. Ríos-Solís (Eur. J. Oper. Res., 2016)

Securing virtual network function placement with high availability guarantees. - Marco Casazza; Pierre Fouilhoux; Mathieu Bouet; Stefano Secci (Networking, 2017)

Anchored reactive and proactive solutions to the CPM-scheduling problem. - Pascale Bendotti; Philippe Chrétienne; Pierre Fouilhoux; Alain Quilliot (Eur. J. Oper. Res., 2017)

The Unit-capacity Constrained Permutation Problem. - Pascale Bendotti; Pierre Fouilhoux; Safia Kedad-Sidhoum (Eur. J. Oper. Res., 2018)

The min-up/min-down unit commitment polytope. - Pascale Bendotti; Pierre Fouilhoux; Cécile Rottner (J. Comb. Optim., 2018)

Branch-and-Cut-and-Price algorithms for the preemptive RCPSP. - Pierre Fouilhoux; Ali Ridha Mahjoub; Alain Quilliot; Hélène Toussaint (RAIRO Oper. Res., 2018)

Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry. - Pascale Bendotti; Pierre Fouilhoux; Cécile Rottner (IPCO, 2019)

On the complexity of the Unit Commitment Problem. - Pascale Bendotti; Pierre Fouilhoux; Cécile Rottner (Ann. Oper. Res., 2019)

Anchored Rescheduling Problems Under Generalized Precedence Constraints. - Pascale Bendotti; Philippe Chrétienne; Pierre Fouilhoux; Adèle Pass-Lanneau (ISCO, 2020)

Symmetry-breaking inequalities for ILP with structured sub-symmetry. - Pascale Bendotti; Pierre Fouilhoux; Cécile Rottner (Math. Program., 2020)

Mixed integer formulations using natural variables for single machine scheduling around a common due date. - Anne-Elisabeth Falq; Pierre Fouilhoux; Safia Kedad-Sidhoum (Discret. Appl. Math., 2021)

Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem. - Pascale Bendotti; Philippe Chrétienne; Pierre Fouilhoux; Adèle Pass-Lanneau (Eur. J. Oper. Res., 2021)

Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem. - Pascale Bendotti; Pierre Fouilhoux; Cécile Rottner (Math. Program., 2021)

Dominance inequalities for scheduling around an unrestrictive common due date. - Anne-Elisabeth Falq; Pierre Fouilhoux; Safia Kedad-Sidhoum (Eur. J. Oper. Res., 2022)

The Anchor-Robust Project Scheduling Problem. - Pascale Bendotti; Philippe Chrétienne; Pierre Fouilhoux; Adèle Pass-Lanneau (Oper. Res., 2023)

Contractions in perfect graph. - Alexandre Dupont-Bouillard; Pierre Fouilhoux; Roland Grappe; Mathieu Lacroix 001 (CoRR, 2024)

A generic Branch-and-Cut algorithm for bi-objective binary linear programs. - Pierre Fouilhoux; Lucas Létocart; Yue Zhang (CoRR, 2024)

Contractions in perfect graphs. - Alexandre Dupont-Bouillard; Pierre Fouilhoux; Roland Grappe; Mathieu Lacroix 001 (Discret. Appl. Math., 2025)

Complexity of the Virtual Network Embedding with uniform demands. - Amal Benhamiche; Pierre Fouilhoux; Lucas Létocart; Nancy Perrot; Alexis Schneider (CoRR, 2025)