Pierre Fouilhoux

Orcid: 0000-0002-4746-5783

According to our database1, Pierre Fouilhoux authored at least 24 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Contractions in perfect graph.
CoRR, 2024

2022
Dominance inequalities for scheduling around an unrestrictive common due date.
Eur. J. Oper. Res., 2022

2021
Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem.
Math. Program., 2021

Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem.
Eur. J. Oper. Res., 2021

Mixed integer formulations using natural variables for single machine scheduling around a common due date.
Discret. Appl. Math., 2021

2020
Symmetry-breaking inequalities for ILP with structured sub-symmetry.
Math. Program., 2020

Anchored Rescheduling Problems Under Generalized Precedence Constraints.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019
On the complexity of the Unit Commitment Problem.
Ann. Oper. Res., 2019

Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018
Branch-and-Cut-and-Price algorithms for the preemptive RCPSP.
RAIRO Oper. Res., 2018

The min-up/min-down unit commitment polytope.
J. Comb. Optim., 2018

The Unit-capacity Constrained Permutation Problem.
Eur. J. Oper. Res., 2018

2017
Anchored reactive and proactive solutions to the CPM-scheduling problem.
Eur. J. Oper. Res., 2017

Securing virtual network function placement with high availability guarantees.
Proceedings of the 2017 IFIP Networking Conference, 2017

2016
Valid inequalities for the synchronization bus timetabling problem.
Eur. J. Oper. Res., 2016

Feasibility recovery for the Unit-capacity Constrained Permutation Problem.
Discret. Optim., 2016

2015
Circuit and bond polytopes on series-parallel graphs.
Discret. Optim., 2015

2014
A branch-and-cut for the Non-Disjoint <i>m</i>-Ring-Star Problem.
RAIRO Oper. Res., 2014

2012
Survivability in hierarchical telecommunications networks.
Networks, 2012

Solving VLSI design and DNA sequencing problems using bipartization of graphs.
Comput. Optim. Appl., 2012

The Non-Disjoint m-Ring-Star Problem: Polyhedral Results and SDH/SONET Network Design.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2010
The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design.
Electron. Notes Discret. Math., 2010

2009
Generating Facets for the Independence System Polytope.
SIAM J. Discret. Math., 2009

2006
Polyhedral results for the bipartite induced subgraph problem.
Discret. Appl. Math., 2006


  Loading...