Algorithms for the rural postman problem
From MaRDI portal
Publication:1906937
DOI10.1016/0305-0548(94)00070-OzbMath0838.90129OpenAlexW2009550050MaRDI QIDQ1906937
Publication date: 30 May 1996
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)00070-o
Related Items (8)
Improving a constructive heuristic for the general routing problem ⋮ A heuristic algorithm based on Monte Carlo methods for the rural postman problem. ⋮ An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances ⋮ A deterministic tabu search algorithm for the capacitated arc routing problem ⋮ The optimisation of the single surface mount device placement machine in printed circuit board assembly: a survey ⋮ Approximate solutions for the maximum benefit chinese postman problem ⋮ A constructive heuristic for the undirected rural postman problem ⋮ Heuristics for the rural postman problem
Cites Work
- Unnamed Item
- Routeing winter gritting vehicles
- Algorithms for the windy postman problem
- Algorithms for the Chinese postman problem on mixed networks
- An algorithm for the Rural Postman problem on a directed graph
- A fundamental problem in vehicle routing
- Approximation Algorithms for Some Postman Problems
- Matching, Euler tours and the Chinese postman
- Networks and vehicle routing for municipal waste collection
This page was built for publication: Algorithms for the rural postman problem
