Frédéric Gardi

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