Heuristics for the rural postman problem

DOI10.1016/j.cor.2009.08.004zbMath1177.90344OpenAlexW2036841901MaRDI QIDQ1046717

Kaj Holmberg

Publication date: 22 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.cor.2009.08.004

zbMATH Keywords

heuristicsrural postman problemsnow removal

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Improving a constructive heuristic for the general routing problem ⋮ Approximation algorithms for some minimum postmen cover problems

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Vehicle routing with a sparse feasibility graph
• The traveling salesman. Computational solutions for RSP applications
• Algorithms for the rural postman problem
• A constructive heuristic for the undirected rural postman problem
• Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
• An SST-based algorithm for the steiner problem in graphs
• Approximation Algorithms for Some Postman Problems
• Efficient path and vertex exchange in steiner tree algorithms
• Arc Routing Problems, Part II: The Rural Postman Problem
• Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
• A cutting plane algorithm for the general routing problem

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