Denis Naddef
According to our database1,
Denis Naddef
authored at least 33 papers
between 1978 and 2010.
Collaborative distances:
Collaborative distances:
Timeline
1980
1985
1990
1995
2000
2005
2010
0
1
2
3
4
1
1
1
1
1
1
1
2
2
1
1
1
3
1
1
1
2
2
1
1
2
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2010
Math. Program., 2010
2008
Greedy approach and multi-criteria simulated annealing for the car sequencing problem.
Eur. J. Oper. Res., 2008
2007
Math. Oper. Res., 2007
2006
Math. Program., 2006
2004
Proceedings of the Sharpest Cut, 2004
2003
Math. Program., 2003
Math. Program., 2003
2002
Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities.
Math. Program., 2002
Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation.
Math. Program., 2002
Proceedings of the Vehicle Routing Problem., 2002
2001
1998
Eur. J. Oper. Res., 1998
1993
The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope.
Math. Program., 1993
Using path inequalities in a branch and cut code for the symmetric traveling salesman problem.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993
1992
Math. Program., 1992
Math. Oper. Res., 1992
Math. Oper. Res., 1992
1991
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities.
Math. Program., 1991
1990
Proceedings of the Polyhedral Combinatorics, 1990
1989
1988
1985
Math. Program., 1985
1984
1983
1982
1981
1980
1978