Approximability of the Multiple Stack TSP

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 establish that asymmetric MaxSTSP and MinSTSP12 are APX, and propose a heuristic that yields to a 1/2, 3/4 and 3/2 standard approximation for respectively MaxSTSP, MaxSTSP12 and MinSTSP12.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Sophie Toulouse
• Keywords: CORR 2010, Delivery Tours, Distinct Networks, Education, LIFO Contraints