Heuristics for the mixed rural postman problem

DOI10.1016/S0305-0548(99)00031-3zbMath0944.90009OpenAlexW2084507558MaRDI QIDQ1968592

Antonio Romero, Rafael Martí, Angel Corberán

Publication date: 22 June 2000

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00031-3

zbMATH Keywords

metaheuristicstabu searcharc routingpostman problems

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Search theory (90B40) Deterministic network models in operations research (90B10)

Related Items (5)

Heuristic method for a mixed capacitated arc routing problem: A refuse collection application ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ The Rural Postman Problem on mixed graphs with turn penalties ⋮ Heuristics for the mixed swapping problem ⋮ Heuristics for single-pass welding task sequencing

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