Frédéric Gardi

Publication Activity (10 Years)

Years Active: 2003-2013
Publications (10 Years): 0

Top Topics

Lessons Learned

Complete Axiomatization

Remains Np Hard

Top Venues

J. Oper. Res. Soc.

Publications

Bertrand Estellon, Frédéric Gardi
Car sequencing is NP-hard: a short proof. J. Oper. Res. Soc. 64 (10) (2013)
Thierry Benoist, Frédéric Gardi, Antoine Jeanjean
Lessons Learned from 15 Years of Operations Research for French TV Channel TF1. Interfaces 42 (6) (2012)
Thierry Benoist, Frédéric Gardi, Antoine Jeanjean, Bertrand Estellon
Randomized Local Search for Real-Life Inventory Routing. Transp. Sci. 45 (3) (2011)
Frédéric Gardi, Karim Nouioua
Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application. EvoCOP (2011)
Frédéric Gardi
On partitioning interval graphs into proper interval subgraphs and related problems. J. Graph Theory 68 (1) (2011)
Thierry Benoist, Bertrand Estellon, Frédéric Gardi, Romain Megel, Karim Nouioua
LocalSolver 1.x: a black-box local-search solver for 0-1 programming. 4OR 9 (3) (2011)
Frédéric Gardi
Optimisation de plans de financement immobiliers. RAIRO Oper. Res. 44 (3) (2010)
Bertrand Estellon, Frédéric Gardi, Karim Nouioua
High-Performance Local Search for Task Scheduling with Human Resource Allocation. SLS (2009)
Frédéric Gardi
Mutual exclusion scheduling with interval graphs or related classes, Part I. Discret. Appl. Math. 157 (1) (2009)
Thierry Benoist, Bertrand Estellon, Frédéric Gardi, Antoine Jeanjean
High-Performance Local Search for Solving Real-Life Inventory Routing Problems. SLS (2009)
Frédéric Gardi
Mutual exclusion scheduling with interval graphs or related classes. Part II. Discret. Appl. Math. 156 (5) (2008)
Bertrand Estellon, Frédéric Gardi, Karim Nouioua
Two local search approaches for solving real-life car sequencing problems. Eur. J. Oper. Res. 191 (3) (2008)
Frédéric Gardi
The Roberts characterization of proper and unit interval graphs. Discret. Math. 307 (22) (2007)
Bertrand Estellon, Frédéric Gardi, Karim Nouioua
Large neighborhood improvements for solving car sequencing problems. RAIRO Oper. Res. 40 (4) (2006)
Frédéric Gardi
Mutual exclusion scheduling with interval graphs or related classes: Complexity and algorithms. 4OR 4 (1) (2006)
Frédéric Gardi
On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications. LATIN (2004)
Frédéric Gardi
Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems. DMTCS (2003)