2 papers
cs.CC2010
Approximability of the Multiple Stack TSP
Sophie Toulouse
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notably…
cs.CC2010
On the complexity of the multiple stack TSP, kSTSP
Sophie Toulouse, Roberto Wolfler Calvo
The multiple Stack Travelling Salesman Problem, STSP, deals with the collect and the deliverance of n commodities in two distinct cities. The two cities are represented by means of…