 | 2011 |
|---|
| 14 |       | Frédéric Gardi,
Karim Nouioua:
Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application.
EvoCOP 2011: 167-178 |
| 13 | | 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): 299-316 (2011) |
| 12 | | Frédéric Gardi:
On partitioning interval graphs into proper interval subgraphs and related problems.
Journal of Graph Theory 68(1): 38-54 (2011) |
| 2010 |
|---|
| 11 | | Frédéric Gardi:
Optimisation de plans de financement immobiliers.
RAIRO - Operations Research 44(3): 207-239 (2010) |
| 2009 |
|---|
| 10 | | Bertrand Estellon,
Frédéric Gardi,
Karim Nouioua:
High-Performance Local Search for Task Scheduling with Human Resource Allocation.
SLS 2009: 1-15 |
| 9 | | Thierry Benoist,
Bertrand Estellon,
Frédéric Gardi,
Antoine Jeanjean:
High-Performance Local Search for Solving Real-Life Inventory Routing Problems.
SLS 2009: 105-109 |
| 8 | | Frédéric Gardi:
Mutual exclusion scheduling with interval graphs or related classes, Part I.
Discrete Applied Mathematics 157(1): 19-35 (2009) |
| 2008 |
|---|
| 7 | | Frédéric Gardi:
Mutual exclusion scheduling with interval graphs or related classes. Part II.
Discrete Applied Mathematics 156(5): 794-812 (2008) |
| 6 | | Bertrand Estellon,
Frédéric Gardi,
Karim Nouioua:
Two local search approaches for solving real-life car sequencing problems.
European Journal of Operational Research 191(3): 928-944 (2008) |
| 2007 |
|---|
| 5 | | Frédéric Gardi:
The Roberts characterization of proper and unit interval graphs.
Discrete Mathematics 307(22): 2906-2908 (2007) |
| 2006 |
|---|
| 4 | | Frédéric Gardi:
Mutual exclusion scheduling with interval graphs or related classes: Complexity and algorithms.
4OR 4(1): 87-90 (2006) |
| 3 | | Bertrand Estellon,
Frédéric Gardi,
Karim Nouioua:
Large neighborhood improvements for solving car sequencing problems.
RAIRO - Operations Research 40(4): 355-379 (2006) |
| 2004 |
|---|
| 2 | | Frédéric Gardi:
On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications.
LATIN 2004: 129-140 |
| 2003 |
|---|
| 1 | | Frédéric Gardi:
Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems.
DMTCS 2003: 168-180 |
Data released under the ODC-BY 1.0 license — See also our legal information page