A constructive heuristic for the undirected rural postman problem
From MaRDI portal
(Redirected from Publication:2496045)
Recommendations
Cites work
- A branch-and-cut algorithm for the undirected rural postman problem
- A polyhedral approach to the rural postman problem
- Algorithms for the rural postman problem
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- scientific article; zbMATH DE number 956790 (Why is no real title available?)
- Improvement Procedures for the Undirected Rural Postman Problem
- Maximum matching and a polyhedron with 0,1-vertices
- New inequalities for the general routing problem
- On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
- Optimal control of plotting and drilling machines: A case study
- The laser-plotter beam routing problem
Cited in
(10)- Heuristics for the rural postman problem
- A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
- A computational study of several heuristics for the DRPP
- A new view on rural postman based on Eulerian extension and matching
- Recent results on arc routing problems: an annotated bibliography
- A generalized constructive algorithm using insertion-based heuristics
- A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem
- Improvement Procedures for the Undirected Rural Postman Problem
- Improving a constructive heuristic for the general routing problem
- Heuristics for a dynamic rural postman problem
This page was built for publication: A constructive heuristic for the undirected rural postman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496045)