Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
From MaRDI portal
Publication:5240198
DOI10.4230/OASIcs.ATMOS.2015.130zbMath1432.90024OpenAlexW2222632097MaRDI QIDQ5240198
René van Bevern, Christian Komusiewicz, Manuel Sorge
Publication date: 24 October 2019
Full work available at URL: http://dx.doi.org/10.4230/OASIcs.ATMOS.2015.130
transportationcombinatorial optimizationvehicle routingNP-hard problemparameterized algorithmChinese postmanrural postman
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks ⋮ An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
Uses Software
Cites Work
- Rural postman parameterized by the number of components of required edges
- An approximation algorithm for the general routing problem
- Constant-factor approximations for capacitated arc routing without triangle inequality
- A new view on rural postman based on Eulerian extension and matching
- An Approximation Algorithm for the Capacitated Arc Routing Problem
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Capacitated arc routing problems
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- On general routing problems
- Approximation Algorithms for Some Postman Problems
- A 3/2-Approximation Algorithm for the Mixed Postman Problem
- On Representatives of Subsets
- Matching, Euler tours and the Chinese postman
- Arc Routing
- Efficient Algorithms for Eulerian Extension and Rural Postman
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
