t IAD Personal page of Pierre Fouilhoux
Pierre FOUILHOUX
Photo de moi

Complete publication list

HAL publication page

Research papers in preparation

Submitted papers in an international journal

Accepted or Published papers in an international journal

  1. Linear inequalities for neighborhood based dominance properties for the common due-date scheduling problem [HAL]
    A-E. Falq, P. Fouilhoux and S. Kedad-Sidhoum
    European Journal of Operational Research (EJOR) 296:2(453-464) 2022

  2. Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem [HAL]
    P. Bendotti, P. Chrétienne, P. Fouilhoux and A. Pass-Lanneau
    European Journal of Operational Research (EJOR) 295:1(22-33) 2021

  3. Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem [HAL]
    P. Bendotti, P. Fouilhoux and C. Rottner
    Mathematical Programming, Series A. (Math Prog) 186(337–372) 2021

  4. Mixed integer formulations using natural variables for single machine scheduling around a common due date [HAL]
    A-E. Falq, P. Fouilhoux and S. Kedad-Sidhoum
    Discret Applied Mathematics (DAM) 290(36-59) 2020

  5. Symmetry-Breaking Inequalities for ILP with Structured Sub-Symmetry
    P. Bendotti, P. Fouilhoux and C. Rottner
    Mathematical Programming, Series B. (Math Prog) 183(61–103) 2020

  6. Anchored Rescheduling Problems under Generalized Precedence Constraints
    P. Bendotti, P. Chrétienne, P. Fouilhoux and A. Pass-Lanneau
    International Symposium on Combinatorial Optimization (ISCO 2020)
    Conference acts in Lecture Notes in Computer Science ISCO (LNCS) 12176(156-166) 2020

  7. Complexity of the Unit Commitment Problem [HAL]
    P. Bendotti, P. Fouilhoux and C. Rotnner
    Annals of Operations Research (ANOR) 274:1(119-130) 2019

  8. Sub-symmetry-breaking inequalities for ILP with Structured Symmetry [HAL]
    P. Bendotti, P. Fouilhoux and C. Rottner
    Conference on Integer Programming and Combinatorial Optimization (IPCO 2019)
    Conference acts in Lecture Notes in Computer Science IPCO (LNCS) 11480(57-71) 2019

  9. A Branch-and-Cut-and-Price algorithm for the preemptive RCPCP [HAL]
    P. Fouilhoux, A.R. Mahjoub, A. Quilliot and H. Toussaint
    RAIRO - Operations Research (RAIRO) 52:2(513-528) 2018

  10. The Min-up/Min-down Unit Commitment Polytope [HAL]
    P. Bendotti, P. Fouilhoux and C. Rottner
    Journal of Combinatorial Optimization (JOCO) 36:3(1024-1058) 2018

  11. The unit-capacity constrained permutation problem
    P. Bendotti, P. Fouilhoux and S. Kedad-Sidhoum
    European Journal of Operational Research (EJOR) 268(463-472) 2018

  12. Securing Virtual Network Function Placement with High Availability Guarantees
    M. Casazza, P. Fouilhoux, M. Bouet and S. Secci
    IFIP Networking Conference 2017

  13. Anchored reactive and proactive solutions to the CPM-scheduling problem
    P. Bendotti, P. Chrétienne, P. Fouilhoux and A. Quilliot
    European Journal of Operational Research (EJOR) 261:1(67-74) 2017

  14. Feasibility recovery for the Permutation Problem using a Unit-Capacity Robot
    Pascale Bendotti and Pierre Fouilhoux
    Discrete Optimization (DO) 22:A(66-86) 2016

  15. Valid Inequalities for the Synchronization Bus Timetabling Problem
    Pierre Fouilhoux, Omar Ibarra-Rojas, Safia Kedad-Sidhoum and Yasmin A. Rios-Solis.
    European Journal of Operational Research (EJOR) 251(442-450) 2016

  16. Circuit and bond polytopes on series-parallel graphs
    Sylvie Borne, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix and Pierre Pesneau
    Discrete Optimization (DO) 17(55-68) 2015

  17. A Branch-and-Cut for the non-disjoint m-Ring-Star problem
    Pierre Fouilhoux and Aurélien Questel
    RAIRO - Operations Research, 48:2(167-188) 2014

  18. The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design
    Philippe Chrétienne, Pierre Fouilhoux, Eric Gourdin and Jean-Mathieu Segura
    Discrete Applied Mathematics (DAM) 164(68-85) 2014

  19. Solving VLSI Design and DNA Sequencing Problems using Bipartization of Graphs
    Pierre Fouilhoux and A. Ridha Mahjoub
    Computational Optimization and Applications (COA) 51:2(749--781) 2012

  20. Survivability in Hierarchical Telecommunications Networks
    Pierre Fouilhoux, Oya Karasan, A. Ridha Mahjoub, Onur Ozkok and Hande Yaman
    Networks, 59:1(37-58) 2012

  21. Generating Facets for the Independence System Polytope
    Pierre Fouilhoux, Martine Labbé, A. Ridha Mahjoub and Hande Yaman
    SIAM Journal on Discrete Mathematics, 23:3(1484-1506) 2009

  22. Polyhedral results for the bipartite induced subgraph problem
    Pierre Fouilhoux and A. Ridha Mahjoub
    Discrete Applied Mathematics (DAM) 154:15(2128-2149) 2006



.