A constructive heuristic for the undirected rural postman problem

DOI10.1016/j.cor.2005.02.014zbMath1094.90040OpenAlexW2071706971MaRDI QIDQ2496045

Gianpaolo Ghiani, Roberto Musmanno, Demetrio Laganà

Publication date: 30 June 2006

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

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

zbMATH Keywords

heuristicsrural postman problemarc routing

Mathematics Subject Classification ID

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

Related Items

A generalized constructive algorithm using insertion-based heuristics, Improving a constructive heuristic for the general routing problem, Recent results on Arc Routing Problems: An annotated bibliography, Heuristics for the rural postman problem

Cites Work

• Unnamed Item
• New inequalities for the general routing problem
• A polyhedral approach to the rural postman problem
• A branch-and-cut algorithm for the undirected rural postman problem
• Algorithms for the rural postman problem
• On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
• Improvement Procedures for the Undirected Rural Postman Problem
• The laser-plotter beam routing problem
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Optimal control of plotting and drilling machines: A case study
• Maximum matching and a polyhedron with 0,1-vertices