A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem

DOI10.1287/TRSC.31.2.187MaRDI QIDQ4355335zbMATH OpenOpenAlexFDO

Authors Moshe Dror, André Langevin

Publication date 17 September 1997

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.31.2.187

zbMATH Keywords

generalized traveling salesmandirected clustered rural postman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• An algorithm for the Rural Postman problem on a directed graph
• A polyhedral approach to the rural postman problem
• The directed profitable location rural postman problem
• A branch-and-cut algorithm for the undirected rural postman problem
• On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
• A constructive heuristic for the undirected rural postman problem
• A two-stage solution approach for the directed rural postman problem with turn penalties
• A note on the undirected rural postman problem polytope
• New results for the directed profitable rural postman problem

Cited in

(8)

• A two-stage solution approach for the directed rural postman problem with turn penalties
• The directed profitable rural postman problem with incompatibility constraints
• Heuristics for single-pass welding task sequencing
• The generalized arc routing problem
• Recent results on arc routing problems: an annotated bibliography
• Approximation algorithms for two clustered arc routing problems
• A random-key genetic algorithm for the generalized traveling salesman problem
• Privatized rural postman problems

This page was built for publication: A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355335)