Naddef D.

D. Naddef

Information about the author D. Naddef will soon be added to the site.
Found 6 papers in total
The domino inequalities: facets for the symmetric travelling salesman polytope
The domino inequalities: facets for the symmetric travelling salesman polytope
2003
Adam Letchford has defined the Domino Parity inequalities for the Symmetric Traveling...
The symmetric traveling salesman polytope revisited
The symmetric traveling salesman polytope revisited
2001
In this paper we present a tour of the symmetric traveling salesman polytope, focusing...
Efficient separation routines for the symmetric travelling salesman problem I: General tools and comb separation
Efficient separation routines for the symmetric travelling salesman problem I: General tools and comb separation
2002
This is the first of a series of two papers dedicated to efficient separation...
Efficient separation routines for the symmetric travelling salesman problem II: Separating multi handle inequalities
Efficient separation routines for the symmetric travelling salesman problem II: Separating multi handle inequalities
2002
This paper is the second in a series of two papers dedicated to the separation problem...
Separating capacity constraints in the CVRP using tabu search
Separating capacity constraints in the CVRP using tabu search
1998
Branch and Cut methods have shown to be very successful in the resolution of some hard...
The crown inequalities for the Symmetric Traveling Salesman Polytope
The crown inequalities for the Symmetric Traveling Salesman Polytope
1992
The authors define a new family of valid inequalities for the Symmetric Traveling...
Papers per page: