scientific article
From MaRDI portal
Publication:2861493
zbMath1274.90329arXiv1009.5030MaRDI QIDQ2861493
Publication date: 8 November 2013
Full work available at URL: https://arxiv.org/abs/1009.5030
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
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 ⋮ Approximation of the double traveling salesman problem with multiple stacks
Cites Work
- Unnamed Item
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
- New neighborhood structures for the double traveling salesman problem with multiple stacks
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Improved deterministic approximation algorithms for max TSP
- Improved approximation algorithms for metric MaxTSP
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- 8/7-approximation algorithm for (1,2)-TSP
- On the Complexity of the Multiple Stack TSP, kSTSP
- The Traveling Salesman Problem with Distances One and Two
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
This page was built for publication: