 | 2008 |
|---|
| 17 |       | Olivier Briant,
Denis Naddef,
Grégory Mounié:
Greedy approach and multi-criteria simulated annealing for the car sequencing problem.
European Journal of Operational Research 191(3): 993-1003 (2008) |
| 2007 |
|---|
| 16 | | Denis Naddef,
Giovanni Rinaldi:
The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation.
Math. Oper. Res. 32(1): 233-256 (2007) |
| 2006 |
|---|
| 15 | | Thomas M. Liebling,
Denis Naddef,
Laurence A. Wolsey:
Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004.
Math. Program. 105(2-3): 157-160 (2006) |
| 2004 |
|---|
| 14 | | Olivier Briant,
Denis Naddef:
The Optimal Diversity Management Problem.
Operations Research 52(4): 515-526 (2004) |
| 2001 |
|---|
| 13 |  | Michael Jünger,
Denis Naddef:
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000]
Springer 2001 |
| 12 | | Denis Naddef,
Yves Pochet:
The Symmetric Traveling Salesman Polytope Revisited.
Math. Oper. Res. 26(4): 700-722 (2001) |
| 1993 |
|---|
| 11 | | Jean-Maurice Clochard,
Denis Naddef:
Using path inequalities in a branch and cut code for the symmetric traveling salesman problem.
IPCO 1993: 291-311 |
| 10 | | Denis Naddef,
Giovanni Rinaldi:
The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope.
Math. Program. 58: 53-88 (1993) |
| 1992 |
|---|
| 9 | | Jean Fonlupt,
Denis Naddef:
The traveling salesman problem in graphs with some excluded minors.
Math. Program. 53: 147-172 (1992) |
| 1991 |
|---|
| 8 | | Denis Naddef,
Giovanni Rinaldi:
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities.
Math. Program. 51: 359-400 (1991) |
| 1988 |
|---|
| 7 | | Denis Naddef,
Cipriano Santos:
One-pass batching algorithms for the one-machine problem.
Discrete Applied Mathematics 21(2): 133-145 (1988) |
| 1985 |
|---|
| 6 | | Gérard Cornuéjols,
Denis Naddef,
William R. Pulleyblank:
The Traveling Salesman Problem in Graphs with 3-Edge Cutsets
J. ACM 32(2): 383-410 (1985) |
| 1984 |
|---|
| 5 | | Denis Naddef:
Pancyclic properties of the graph of some 0-1 polyhedra.
J. Comb. Theory, Ser. B 37(1): 10-26 (1984) |
| 4 | | Denis Naddef,
William R. Pulleyblank:
Hamiltonicity in (0-1)-polyhedra.
J. Comb. Theory, Ser. B 37(1): 41-52 (1984) |
| 1981 |
|---|
| 3 | | Denis Naddef,
William R. Pulleyblank:
Matchings in regular graphs.
Discrete Mathematics 34(3): 283-291 (1981) |
| 2 | | Denis Naddef,
William R. Pulleyblank:
Hamiltonicity and combinatorial polyhedra.
J. Comb. Theory, Ser. B 31(3): 297-312 (1981) |
| 1980 |
|---|
| 1 | | Denis Naddef,
Najiba Sbihi,
Maurice Tchuente:
Independence systems with continuous cardinality of bases.
Discrete Mathematics 31(1): 107-109 (1980) |
