A computational study of several heuristics for the DRPP
From MaRDI portal
(Redirected from Publication:1804375)
Recommendations
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3908160 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- A fundamental problem in vehicle routing
- An algorithm for the Rural Postman problem on a directed graph
- Matching, Euler tours and the Chinese postman
- Networks and vehicle routing for municipal waste collection
- On general routing problems
- The ellipsoid method and its consequences in combinatorial optimization
Cited in
(9)- An algorithm for the Rural Postman problem on a directed graph
- OAR lib: an open source arc routing library
- A constructive heuristic for the undirected rural postman problem
- Solving the close-enough arc routing problem
- A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
- Heuristics for a dynamic rural postman problem
- Algorithms for the rural postman problem
- Theoretical implications involved in the DDRP method
- A heuristic algorithm for the drone rural postman problem
This page was built for publication: A computational study of several heuristics for the DRPP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804375)