A computational study of several heuristics for the DRPP

DOI10.1007/BF01299159zbMath0822.90051MaRDI QIDQ1804375

Yanyan Li

Publication date: 9 October 1995

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

lower boundheuristic algorithmsrural postman problemcutting plane techniquesarc routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (2)

OAR lib: an open source arc routing library ⋮ Solving the close-enough arc routing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• An algorithm for the Rural Postman problem on a directed graph
• On general routing problems
• A fundamental problem in vehicle routing
• Matching, Euler tours and the Chinese postman
• Networks and vehicle routing for municipal waste collection

This page was built for publication: A computational study of several heuristics for the DRPP