AbstractIn this paper we give an alternate formulation of the symmetric traveling salesman problem and give its properties. We compare the polytope defined by this formulation, U(n), with the standard subtour elimination polytope SEP(n). We show U(n)⊆SEP(n)
AbstractWhile it had been known for a long time how to transform an asymmetric traveling salesman (A...
AbstractWhen should two traveling salesman problems be equivalent? This paper contains an answer whi...
We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the ...
AbstractIn this paper we give an alternate formulation of the symmetric traveling salesman problem a...
The classical polytope associated with the symmetric traveling salesman problem (STSP) is usually st...
In this paper we present a tour of the symmetric traveling salesman polytope, focusing on inequaliti...
International audienceWe propose a new procedure of facet composition for the Symmetric Traveling Sa...
We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the ...
The path, the wheelbarrow, and the bicycle inequalities have been shown in [5] to be facet defining ...
A new bound for the Symmetric Traveling Salesman Problem is proposed, using a matroid theoretic form...
International audienceThe path, the wheelbarrow, and the bicycle inequalities have been shown by Cor...
This paper presents a new heuristic algorithm for the classical symmetric traveling salesman problem...
In this paper, we use a reformulation of the symmetric and the asymmetric travelling salesman proble...
The Traveling Salesman Problem or TSP is probably the best known combinatorial optimisation problem....
When the matrix of distances between cities is symmetric and circulant, the traveling salesman probl...
AbstractWhile it had been known for a long time how to transform an asymmetric traveling salesman (A...
AbstractWhen should two traveling salesman problems be equivalent? This paper contains an answer whi...
We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the ...
AbstractIn this paper we give an alternate formulation of the symmetric traveling salesman problem a...
The classical polytope associated with the symmetric traveling salesman problem (STSP) is usually st...
In this paper we present a tour of the symmetric traveling salesman polytope, focusing on inequaliti...
International audienceWe propose a new procedure of facet composition for the Symmetric Traveling Sa...
We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the ...
The path, the wheelbarrow, and the bicycle inequalities have been shown in [5] to be facet defining ...
A new bound for the Symmetric Traveling Salesman Problem is proposed, using a matroid theoretic form...
International audienceThe path, the wheelbarrow, and the bicycle inequalities have been shown by Cor...
This paper presents a new heuristic algorithm for the classical symmetric traveling salesman problem...
In this paper, we use a reformulation of the symmetric and the asymmetric travelling salesman proble...
The Traveling Salesman Problem or TSP is probably the best known combinatorial optimisation problem....
When the matrix of distances between cities is symmetric and circulant, the traveling salesman probl...
AbstractWhile it had been known for a long time how to transform an asymmetric traveling salesman (A...
AbstractWhen should two traveling salesman problems be equivalent? This paper contains an answer whi...
We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the ...
DOI
Add to ORKG