Algorithms for the windy postman problem

DOI10.1016/0305-0548(94)90079-5zbMath0810.90129OpenAlexW2028909191MaRDI QIDQ1332802

Wen Lea Pearn, Mao-lin Li

Publication date: 5 September 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90079-5

zbMATH Keywords

NP-completeheuristic solutionChinese Postmanwindy postman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (6)

Solvable cases of the \(k\)-person Chinese postman problem ⋮ Lower bounds and heuristics for the windy rural postman problem ⋮ New heuristic algorithms for the windy rural postman problem ⋮ Algorithms for the rural postman problem ⋮ Routing problems: A bibliography ⋮ Approximate solutions for the maximum benefit chinese postman problem

Cites Work

• Unnamed Item
• Unnamed Item
• On the windy postman problem
• On the windy postman problem on Eulerian graphs
• Routeing winter gritting vehicles
• Solvable cases of the \(k\)-person Chinese postman problem
• The Chinese Postman Problem for Mixed Networks
• On the complexity of edge traversing
• 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 windy postman problem