On the Complexity of the Multiple Stack TSP, kSTSP

DOI10.1007/978-3-642-02017-9_38zbMath1241.68072arXiv1009.5029OpenAlexW2103427291MaRDI QIDQ3630221

Roberto Wolfler Calvo, Sophie Toulouse

Publication date: 3 June 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.5029

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items

The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach ⋮ Exact algorithms for the double vehicle routing problem with multiple stacks ⋮ A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks ⋮ Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks ⋮ Efficient algorithms for the double traveling salesman problem with multiple stacks ⋮ Unnamed Item ⋮ Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints ⋮ Approximation of the double traveling salesman problem with multiple stacks ⋮ A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks

This page was built for publication: On the Complexity of the Multiple Stack TSP, kSTSP