The Rural Postman Problem on mixed graphs with turn penalties

DOI10.1016/S0305-0548(00)00091-5zbMath0994.90108MaRDI QIDQ5959378

Angel Corberán, Rafael Martí, Eulalia Martínez, David Soler

Publication date: 30 July 2002

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

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

Heuristic method for a mixed capacitated arc routing problem: A refuse collection application, Solving an urban waste collection problem using ants heuristics, An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An additive bounding procedure for the asymmetric travelling salesman problem
• The traveling salesman problem: An overview of exact and approximate algorithms
• Searching for a strong double tracing in a graph
• Modeling and solving several classes of arc routing problems as traveling salesman problems
• Heuristics for the mixed rural postman problem
• The Capacitated Canadian Postman Problem
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• The Directed Rural Postman Problem with Turn Penalties