Denis Naddef

Publication Activity (10 Years)

Years Active: 1980-2010
Publications (10 Years): 0

Joseph Fourier University, Grenoble, France (PHD)

Education History

Joseph Fourier University, Grenoble, France

PHD

Publications

Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. 124 (1-2) (2010)
Olivier Briant, Denis Naddef, Grégory Mounié
Greedy approach and multi-criteria simulated annealing for the car sequencing problem. Eur. J. Oper. Res. 191 (3) (2008)
Denis Naddef, Giovanni Rinaldi
The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation. Math. Oper. Res. 32 (1) (2007)
Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. Math. Program. 105 (2-3) (2006)
Olivier Briant, Denis Naddef
The Optimal Diversity Management Problem. Oper. Res. 52 (4) (2004)
Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
The Aussois 2000 workshop in combinatorial optimization introduction. Math. Program. 94 (2-3) (2003)
Denis Naddef, Emmanuel Wild
The domino inequalities: facets for the symmetric traveling salesman polytope. Math. Program. 98 (1-3) (2003)
Denis Naddef, Stefan Thienel
Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation. Math. Program. 92 (2) (2002)
Denis Naddef, Stefan Thienel
Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities. Math. Program. 92 (2) (2002)
Denis Naddef, Yves Pochet
The Symmetric Traveling Salesman Polytope Revisited. Math. Oper. Res. 26 (4) (2001)
P. Augerat, José-Manuel Belenguer, Enrique Benavent, Ángel Corberán, Denis Naddef
Separating capacity constraints in the CVRP using tabu search. Eur. J. Oper. Res. 106 (2-3) (1998)
Denis Naddef, Giovanni Rinaldi
The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope. Math. Program. 58 (1993)
Jean-Maurice Clochard, Denis Naddef
Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. IPCO (1993)
Denis Naddef, Giovanni Rinaldi
The Crown Inequalities for the Symmetric Traveling Salesman Polytope. Math. Oper. Res. 17 (2) (1992)
Jean Fonlupt, Denis Naddef
The traveling salesman problem in graphs with some excluded minors. Math. Program. 53 (1992)
Denis Naddef
The Binested Inequalities for the Symmetric Traveling Salesman Polytope. Math. Oper. Res. 17 (4) (1992)
Denis Naddef, Giovanni Rinaldi
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities. Math. Program. 51 (1991)
Denis Naddef
Handles and Teeth in the Symmetric Traveling Salesman Problems. Polyhedral Combinatorics (1990)
Denis Naddef
The hirsch conjecture is true for (0, 1)-polytopes. Math. Program. 45 (1-3) (1989)
Denis Naddef, Cipriano Santos
One-pass batching algorithms for the one-machine problem. Discret. Appl. Math. 21 (2) (1988)
Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank
The Traveling Salesman Problem in Graphs with 3-Edge Cutsets J. ACM 32 (2) (1985)
Gérard Cornuéjols, Jean Fonlupt, Denis Naddef
The traveling salesman problem on a graph and some related integer polyhedra. Math. Program. 33 (1) (1985)
Denis Naddef, William R. Pulleyblank
Hamiltonicity in (0-1)-polyhedra. J. Comb. Theory, Ser. B 37 (1) (1984)
Denis Naddef
Pancyclic properties of the graph of some 0-1 polyhedra. J. Comb. Theory, Ser. B 37 (1) (1984)
Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank
Halin graphs and the travelling salesman problem. Math. Program. 26 (3) (1983)
Denis Naddef
Rank of maximum matchings in a graph. Math. Program. 22 (1) (1982)
Denis Naddef, William R. Pulleyblank
Matchings in regular graphs. Discret. Math. 34 (3) (1981)
Denis Naddef, William R. Pulleyblank
Hamiltonicity and combinatorial polyhedra. J. Comb. Theory, Ser. B 31 (3) (1981)
Denis Naddef, Najiba Sbihi, Maurice Tchuente
Independence systems with continuous cardinality of bases. Discret. Math. 31 (1) (1980)

Denis Naddef.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Denis Naddef