Denis Naddef - RankMe

35 papers B 1Journal 27Unranked 1

Year	Rank	Type	Title / Venue / Authors
2010	—	`book`	50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
2010	J	`jnl`	Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
2008	J	`jnl`	Greedy approach and multi-criteria simulated annealing for the car sequencing problem. Eur. J. Oper. Res. Olivier Briant, Denis Naddef, Grégory Mounié
2007	J	`jnl`	The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation. Math. Oper. Res. Denis Naddef, Giovanni Rinaldi
2006	J	`jnl`	Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. Math. Program. Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
2004	—	`ch.`	The Domino Inequalities for the Symmetric Traveling Salesman Problem. The Sharpest Cut Denis Naddef
2004	J	`jnl`	The Optimal Diversity Management Problem. Oper. Res. Olivier Briant, Denis Naddef
2003	J	`jnl`	The Aussois 2000 workshop in combinatorial optimization introduction. Math. Program. Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
2003	J	`jnl`	The domino inequalities: facets for the symmetric traveling salesman polytope. Math. Program. Denis Naddef, Emmanuel Wild
2002	—	`ch.`	Branch-And-Cut Algorithms for the Capacitated VRP. The Vehicle Routing Problem Denis Naddef, Giovanni Rinaldi
2002	J	`jnl`	Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation. Math. Program. Denis Naddef, Stefan Thienel
2002	J	`jnl`	Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities. Math. Program. Denis Naddef, Stefan Thienel
2001	—	`ed.`	Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000] Computational Combinatorial Optimization Michael Jünger, Denis Naddef
2001	J	`jnl`	The Symmetric Traveling Salesman Polytope Revisited. Math. Oper. Res. Denis Naddef, Yves Pochet
1998	J	`jnl`	Separating capacity constraints in the CVRP using tabu search. Eur. J. Oper. Res. P. Augerat, José-Manuel Belenguer, Enrique Benavent, Ángel Corberán, Denis Naddef
1993	J	`jnl`	The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope. Math. Program. Denis Naddef, Giovanni Rinaldi
1993	B	`conf`	Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. IPCO Jean-Maurice Clochard, Denis Naddef
1992	J	`jnl`	The Binested Inequalities for the Symmetric Traveling Salesman Polytope. Math. Oper. Res. Denis Naddef
1992	J	`jnl`	The Crown Inequalities for the Symmetric Traveling Salesman Polytope. Math. Oper. Res. Denis Naddef, Giovanni Rinaldi
1992	J	`jnl`	The traveling salesman problem in graphs with some excluded minors. Math. Program. Jean Fonlupt, Denis Naddef
1991	J	`jnl`	The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities. Math. Program. Denis Naddef, Giovanni Rinaldi
1990	—	`conf`	Handles and Teeth in the Symmetric Traveling Salesman Problems. Polyhedral Combinatorics Denis Naddef
1989	J	`jnl`	The hirsch conjecture is true for (0, 1)-polytopes. Math. Program. Denis Naddef
1988	J	`jnl`	One-pass batching algorithms for the one-machine problem. Discret. Appl. Math. Denis Naddef, Cipriano A. Santos
1985	J	`jnl`	The Traveling Salesman Problem in Graphs with 3-Edge Cutsets J. ACM Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank
1985	J	`jnl`	The traveling salesman problem on a graph and some related integer polyhedra. Math. Program. Gérard Cornuéjols, Jean Fonlupt, Denis Naddef
1984	J	`jnl`	Hamiltonicity in (0-1)-polyhedra. J. Comb. Theory B Denis Naddef, William R. Pulleyblank
1984	J	`jnl`	Pancyclic properties of the graph of some 0-1 polyhedra. J. Comb. Theory B Denis Naddef
1983	J	`jnl`	Halin graphs and the travelling salesman problem. Math. Program. Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank
1983	—	`book`	Polyèdres et structures combinatoires. Denis Naddef
1982	J	`jnl`	Rank of maximum matchings in a graph. Math. Program. Denis Naddef
1981	J	`jnl`	Hamiltonicity and combinatorial polyhedra. J. Comb. Theory B Denis Naddef, William R. Pulleyblank
1981	J	`jnl`	Matchings in regular graphs. Discret. Math. Denis Naddef, William R. Pulleyblank
1980	J	`jnl`	Independence systems with continuous cardinality of bases. Discret. Math. Denis Naddef, Najiba Sbihi, Maurice Tchuenté
1978	—	`—`	Rang des couplages maximums d'un graphe. Denis Naddef