Approximation of the double traveling salesman problem with multiple stacks
From MaRDI portal
Publication:2034797
DOI10.1016/j.tcs.2021.05.016OpenAlexW3161263169MaRDI QIDQ2034797
Laurent Alfandari, Sophie Toulouse
Publication date: 23 June 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.00138
Related Items
In memory of Jérôme Monnot ⋮ A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ An LP-based approximation algorithm for the generalized traveling salesman path problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential approximation results for the traveling salesman and related problems
- Exact algorithms for the double vehicle routing problem with multiple stacks
- 35/44-approximation for asymmetric maximum TSP with triangle inequality
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- Minimizing setups in ordered sets of fixed width
- New neighborhood structures for the double traveling salesman problem with multiple stacks
- A better differential approximation ratio for symmetric TSP
- Approximation results for the weighted \(P_4\) partition problem
- New differential approximation algorithm for \(k\)-customer vehicle routing problem
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Deterministic 7/8-approximation for the metric maximum TSP
- Improved deterministic approximation algorithms for max TSP
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- 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
- Approximation algorithms for some vehicle routing problems
- Differential approximation results for the traveling salesman problem with distances 1 and 2
- z-Approximations
- New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- An exact method for the double TSP with multiple stacks
- The Design of Approximation Algorithms
- Exact solutions to the double travelling salesman problem with multiple stacks
- Differential Approximation of the Multiple Stacks TSP
- A Dynamic Programming Approach to Sequencing Problems
- 8/7-approximation algorithm for (1,2)-TSP
- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
- On the Complexity of the Multiple Stack TSP, kSTSP
- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
- The Traveling Salesman Problem with Distances One and Two
- New Approximation Algorithms for (1,2)-TSP
- A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
