Denis Naddef

发表

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

Jean-Maurice Clochard, Denis Naddef, 1993, IPCO.

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

Gérard Cornuéjols, Jean Fonlupt, Denis Naddef, 1985, Math. Program..

Branch-And-Cut Algorithms for the Capacitated VRP

Giovanni Rinaldi, Denis Naddef, G. Rinaldi, 2001, The Vehicle Routing Problem.

The domino inequalities: facets for the symmetric traveling salesman polytope

Denis Naddef, Emmanuel Wild, 2003, Math. Program..

Hamiltonicity and combinatorial polyhedra

William R. Pulleyblank, Denis Naddef, W. Pulleyblank, 1981, J. Comb. Theory, Ser. B.

French Army logistics - Multimodal transportation optimization software helps move military materiel, troops from bases to operation scenes.

Olivier Briant, Denis Naddef, Thomas Barthoulot, 2015 .

The graphical relaxation: A new framework for the symmetric traveling salesman polytope

Giovanni Rinaldi, Denis Naddef, G. Rinaldi, 1993, Math. Program..

Handles and Teeth in the Symmetric Traveling Salesman Problems

Denis Naddef, 1990, Polyhedral Combinatorics.

The Symmetric Traveling Salesman Polytope Revisited

Yves Pochet, Denis Naddef, 2001, Math. Oper. Res..

Separating capacity constraints in the CVRP using tabu search

Ángel Corberán, José-Manuel Belenguer, Enrique Benavent, 1998, Eur. J. Oper. Res..

The traveling salesman problem in graphs with some excluded minors

Jean Fonlupt, Denis Naddef, 1992, Math. Program..

Pancyclic properties of the graph of some 0-1 polyhedra

Denis Naddef, D. Naddef, 1984, J. Comb. Theory, Ser. B.

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

Giovanni Rinaldi, Denis Naddef, G. Rinaldi, 2007, Math. Oper. Res..

Computational Combinatorial Optimization

Michael Jünger, Denis Naddef, M. Jünger, 2001, Lecture Notes in Computer Science.

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

Denis Naddef, D. Naddef, 1989, Mathematical programming.

The Domino Inequalities for the Symmetric Traveling Salesman Problem

Denis Naddef, 2004, The Sharpest Cut.

The traveling salesman problem in graphs with 3-edge cutsets

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

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000]

Michael Jünger, Denis Naddef, 2000 .

Branch-and-Cut Algorithms

Giovanni Rinaldi, Denis Naddef, 2000 .

Heuristic approach to the artificial intelligence design challenge

Ting-Yi Sung, Denis Naddef, Her-Jiun Sheu, 1988 .

The Binested Inequalities for the Symmetric Traveling Salesman Polytope

Denis Naddef, 1992, Math. Oper. Res..

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

Grégory Mounié, Olivier Briant, Denis Naddef, 2008, Eur. J. Oper. Res..

One-pass batching algorithms for the one-machine problem

Denis Naddef, Cipriano Santos, D. Naddef, 1988, Discret. Appl. Math..

Rang des couplages maximums d'un graphe

Denis Naddef, 1978 .

Traces of the XII Aussois Workshop on Combinatorial Optimization

Laurence A. Wolsey, Michael Jünger, Gerhard Reinelt, 2010, Math. Program..

Matchings in regular graphs

William R. Pulleyblank, Denis Naddef, W. Pulleyblank, 1981, Discret. Math..

Independence systems with continuous cardinality of bases

Maurice Tchuente, Denis Naddef, Najiba Sbihi, 1980, Discret. Math..

Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004

Laurence A. Wolsey, Thomas M. Liebling, Denis Naddef, 2006, Math. Program..

ALGORITHMS 1 AND C++ : Data Structures, Graphs, Recursive Programming

Jean-Louis Roch, Stefanie Hahmann, Samir Jafar, 2001 .

Polyèdres et structures combinatoires

Denis Naddef, 1983 .

The Optimal Diversity Management Problem

Olivier Briant, Denis Naddef, D. Naddef, 2004, Oper. Res..

Halin graphs and the travelling salesman problem

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

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

Giovanni Rinaldi, Denis Naddef, 1991, Math. Program..

The Crown Inequalities for the Symmetric Traveling Salesman Polytope

Giovanni Rinaldi, Denis Naddef, G. Rinaldi, 1992, Math. Oper. Res..

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

Denis Naddef, Stefan Thienel, 2002, Math. Program..

Rank of maximum matchings in a graph

Denis Naddef, D. Naddef, 1982, Math. Program..

Branch and cut algorithms for the vehicle routing problem

Giovanni Rinaldi, Denis Naddef, 1999 .

A heuristic approach to the AIAA Design Challenge problem

Ting-Yi Sung, Denis Naddef, Her-Jiun Sheu, 1987 .

The Aussois 2000 workshop in combinatorial optimization introduction

Laurence A. Wolsey, Thomas M. Liebling, Denis Naddef, 2003, Math. Program..

Computational results with a branch and cut code for the capacitated vehicle routing problem

Giovanni Rinaldi, Enrique Benavent, Denis Naddef, 1998 .

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

Denis Naddef, Stefan Thienel, 2002, Math. Program..

Hamiltonicity in (0-1)-polyhedra

William R. Pulleyblank, Denis Naddef, W. Pulleyblank, 1984, J. Comb. Theory, Ser. B.

Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings

William R. Pulleyblank, Denis Naddef, 1982 .

Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP

Denis Naddef, D. Naddef, 2007 .

A remark on “Integer linear programming formulation for a Vehicle Routing Problem” by N.R. Achutan and L. Caccetta, or how to use the Clark & Wright savings to write such integer linear programming formulations

Denis Naddef, 1994 .