Approximation Algorithms for Some Postman Problems
From MaRDI portal
Cited in
(53)- Heuristics for the rural postman problem
- Designing networks with compact routing tables
- On the windy postman problem on Eulerian graphs
- An approximation algorithm for the general routing problem
- On the mixed Chinese postman problem
- Algorithms for the windy postman problem
- A polyhedral approach to the rural postman problem
- A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
- Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
- Min-max cover of a graph with a small number of parts
- Capacitated arc routing problem with deadheading demands
- Heuristic methods and applications: A categorized survey
- An extension of Christofides heuristic to the k-person travelling salesman problem
- A GRASP heuristic for the mixed Chinese postman problem
- A capacitated general routing problem on mixed networks
- Algorithms for the Chinese postman problem on mixed networks
- Algorithms for the rural postman problem
- Routing problems: A bibliography
- A new view on rural postman based on Eulerian extension and matching
- Approximation algorithms with constant ratio for general cluster routing problems
- A LP-based approximation algorithm for generalized traveling salesperson path problem
- Approximation algorithms for some min-max postmen cover problems
- OAR lib: an open source arc routing library
- New heuristic algorithms for the windy rural postman problem
- A note on approximation algorithms of the clustered traveling salesman problem
- The commodity-split multi-compartment capacitated arc routing problem
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- An LP-based approximation algorithm for the generalized traveling salesman path problem
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- Approximation algorithms for a mixed postman problem with restrictions on the arcs
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs
- Recent results on arc routing problems: an annotated bibliography
- Efficient algorithms for Eulerian extension
- From few components to an Eulerian graph by adding ARCS
- Rural postman parameterized by the number of components of required edges
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
- Approximation algorithms for the single robot line coverage problem
- A decade of capacitated arc routing
- Differential approximation of NP-hard problems with equal size feasible solutions
- An improved approximation algorithm for the clustered traveling salesman problem
- Eulerian location problems
- Approximation algorithms for mixed, windy, and capacitated arc routing problems
- On a routing and scheduling problem concerning multiple edge traversals in graphs
- Arc routing problems: A review of the past, present, and future
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
- Improving a constructive heuristic for the general routing problem
- The single robot line coverage problem: Theory, algorithms, and experiments
- Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem
- Approximation algorithms for two clustered arc routing problems
- 1.6-approximation algorithm for generalized traveling salesman path problem
- Minimum cost nowhere-zero flows and cut-balanced orientations
- A deterministic tabu search algorithm for the capacitated arc routing problem
This page was built for publication: Approximation Algorithms for Some Postman Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4191881)
