Denis Naddef

According to our database, Denis Naddef authored at least 33 papers between 1978 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

Traces of the XII Aussois Workshop on Combinatorial Optimization.

Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey

Math. Program., 2010

2008

Greedy approach and multi-criteria simulated annealing for the car sequencing problem.

Olivier Briant, Denis Naddef, Grégory Mounié

Eur. J. Oper. Res., 2008

2007

The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation.

Denis Naddef, Giovanni Rinaldi

Math. Oper. Res., 2007

2006

Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004.

Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey

Math. Program., 2006

2004

The Optimal Diversity Management Problem.

Olivier Briant, Denis Naddef

Oper. Res., 2004

The Domino Inequalities for the Symmetric Traveling Salesman Problem.

Denis Naddef

Proceedings of the Sharpest Cut, 2004

2003

The domino inequalities: facets for the symmetric traveling salesman polytope.

Denis Naddef, Emmanuel Wild

Math. Program., 2003

The Aussois 2000 workshop in combinatorial optimization introduction.

Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey

Math. Program., 2003

2002

Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities.

Denis Naddef, Stefan Thienel

Math. Program., 2002

Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation.

Denis Naddef, Stefan Thienel

Math. Program., 2002

Branch-And-Cut Algorithms for the Capacitated VRP.

Denis Naddef, Giovanni Rinaldi

Proceedings of the Vehicle Routing Problem., 2002

2001

The Symmetric Traveling Salesman Polytope Revisited.

Denis Naddef, Yves Pochet

Math. Oper. Res., 2001

1998

Separating capacity constraints in the CVRP using tabu search.

P. Augerat, José-Manuel Belenguer, Enrique Benavent, Ángel Corberán, Denis Naddef

Eur. J. Oper. Res., 1998

1993

The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope.

Denis Naddef, Giovanni Rinaldi

Math. Program., 1993

Using path inequalities in a branch and cut code for the symmetric traveling salesman problem.

Jean-Maurice Clochard, Denis Naddef

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992

The traveling salesman problem in graphs with some excluded minors.

Jean Fonlupt, Denis Naddef

Math. Program., 1992

The Crown Inequalities for the Symmetric Traveling Salesman Polytope.

Denis Naddef, Giovanni Rinaldi

Math. Oper. Res., 1992

The Binested Inequalities for the Symmetric Traveling Salesman Polytope.

Denis Naddef

Math. Oper. Res., 1992

1991

The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities.

Denis Naddef, Giovanni Rinaldi

Math. Program., 1991

1990

Handles and Teeth in the Symmetric Traveling Salesman Problems.

Denis Naddef

Proceedings of the Polyhedral Combinatorics, 1990

1989

The hirsch conjecture is true for (0, 1)-polytopes.

Denis Naddef

Math. Program., 1989

1988

One-pass batching algorithms for the one-machine problem.

Denis Naddef, Cipriano Santos

Discret. Appl. Math., 1988

1985

The Traveling Salesman Problem in Graphs with 3-Edge Cutsets

Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank

J. ACM, April, 1985

The traveling salesman problem on a graph and some related integer polyhedra.

Gérard Cornuéjols, Jean Fonlupt, Denis Naddef

Math. Program., 1985

1984

Hamiltonicity in (0-1)-polyhedra.

Denis Naddef, William R. Pulleyblank

J. Comb. Theory, Ser. B, 1984

Pancyclic properties of the graph of some 0-1 polyhedra.

Denis Naddef

J. Comb. Theory, Ser. B, 1984

1983

Halin graphs and the travelling salesman problem.

Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank

Math. Program., 1983

Polyèdres et structures combinatoires.

Denis Naddef

, 1983

1982

Rank of maximum matchings in a graph.

Denis Naddef

Math. Program., 1982

1981

Hamiltonicity and combinatorial polyhedra.

Denis Naddef, William R. Pulleyblank

J. Comb. Theory, Ser. B, 1981

Matchings in regular graphs.

Denis Naddef, William R. Pulleyblank

Discret. Math., 1981

1980

Independence systems with continuous cardinality of bases.

Denis Naddef, Najiba Sbihi, Maurice Tchuenté

Discret. Math., 1980

1978

Rang des couplages maximums d'un graphe.

Denis Naddef

PhD thesis, 1978