Algorithms for the rural postman problem

DOI10.1016/0305-0548(94)00070-OMaRDI QIDQ1906937zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

zbMATH Keywords

NP-completeChinese postmanrural postmanpolynomial-time bounded algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• An algorithm for the Rural Postman problem on a directed graph
• A computational study of several heuristics for the DRPP
• Algorithms for the windy postman problem
• scientific article; zbMATH DE number 27244
• Algorithms for the Chinese postman problem on mixed networks

Cites work

• scientific article; zbMATH DE number 192876 (Why is no real title available?)
• A fundamental problem in vehicle routing
• Algorithms for the Chinese postman problem on mixed networks
• Algorithms for the windy postman problem
• An algorithm for the Rural Postman problem on a directed graph
• Approximation Algorithms for Some Postman Problems
• Matching, Euler tours and the Chinese postman
• Networks and vehicle routing for municipal waste collection
• Routeing winter gritting vehicles

Cited in

(22)

• On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
• An algorithm for the Rural Postman problem on a directed graph
• A constructive heuristic for the undirected rural postman problem
• A branch-and-bound algorithm for the time-dependent rural postman problem
• Solving the hierarchical Chinese postman problem as a rural postman problem.
• Improvement Procedures for the Undirected Rural Postman Problem
• A new view on rural postman based on Eulerian extension and matching
• An open-source desktop application for generating arc-routing benchmark instances
• Rural postman parameterized by the number of components of required edges
• Reoptimizing the rural postman problem
• Developing the branch and bound method in the problem of searching for the optimal cyclic route (cyclic rural postman problem)
• A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
• Approximate solutions for the maximum benefit chinese postman problem
• The optimisation of the single surface mount device placement machine in printed circuit board assembly: a survey
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A polyhedral approach to the rural postman problem
• Heuristics for the rural postman problem
• On \((1+\varepsilon)\)-approximate data reduction for the Rural Postman problem
• Improving a constructive heuristic for the general routing problem
• A heuristic for the periodic rural postman problem
• On crossings, the crossing postman problem, and the rural postman problem
• A heuristic algorithm for the drone rural postman problem

This page was built for publication: Algorithms for the rural postman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906937)