Frédéric Gardi

According to our database1, Frédéric Gardi authored at least 17 papers between 2003 and 2013.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2013
Car sequencing is NP-hard: a short proof.
J. Oper. Res. Soc., 2013

2012
Lessons Learned from 15 Years of Operations Research for French TV Channel TF1.
Interfaces, 2012

2011
Randomized Local Search for Real-Life Inventory Routing.
Transp. Sci., 2011

On partitioning interval graphs into proper interval subgraphs and related problems.
J. Graph Theory, 2011

LocalSolver 1.x: a black-box local-search solver for 0-1 programming.
4OR, 2011

Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011

2010
Optimisation de plans de financement immobiliers.
RAIRO Oper. Res., 2010

2009
Mutual exclusion scheduling with interval graphs or related classes, Part I.
Discret. Appl. Math., 2009

High-Performance Local Search for Task Scheduling with Human Resource Allocation.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

High-Performance Local Search for Solving Real-Life Inventory Routing Problems.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

2008
Two local search approaches for solving real-life car sequencing problems.
Eur. J. Oper. Res., 2008

Mutual exclusion scheduling with interval graphs or related classes. Part II.
Discret. Appl. Math., 2008

2007
The Roberts characterization of proper and unit interval graphs.
Discret. Math., 2007

2006
Large neighborhood improvements for solving car sequencing problems.
RAIRO Oper. Res., 2006

Mutual exclusion scheduling with interval graphs or related classes: Complexity and algorithms.
4OR, 2006

2004
On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003


  Loading...