New heuristic algorithms for the windy rural postman problem
From MaRDI portal
Publication:2387296
Recommendations
Cites work
- scientific article; zbMATH DE number 1703887 (Why is no real title available?)
- scientific article; zbMATH DE number 4068590 (Why is no real title available?)
- scientific article; zbMATH DE number 1187150 (Why is no real title available?)
- scientific article; zbMATH DE number 3724496 (Why is no real title available?)
- A GRASP heuristic for the mixed Chinese postman problem
- A cutting plane algorithm for the windy postman problem
- Algorithms for the windy postman problem
- An algorithm for the Rural Postman problem on a directed graph
- Approximation Algorithms for Some Postman Problems
- Arc Routing Problems, Part II: The Rural Postman Problem
- Fundamentals of scatter search and path relinking
- Improvement Procedures for the Undirected Rural Postman Problem
- Lower bounds and heuristics for the windy rural postman problem
- On the windy postman problem
- On the windy postman problem on Eulerian graphs
- Scatter search. Methodology and implementation in C. With CD-ROM.
- TSPLIB—A Traveling Salesman Problem Library
- The Chinese Postman Problem for Mixed Networks
Cited in
(15)- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
- A metaheuristic for the min-max windy rural postman problem with K vehicles
- Lower bounds and heuristics for the windy rural postman problem
- Plowing with precedence in polynomial time
- Aesthetic considerations for the min-max \(K\)-windy rural postman problem
- On the windy postman problem
- A new view on rural postman based on Eulerian extension and matching
- The single robot line coverage problem: Theory, algorithms, and experiments
- Improvement Procedures for the Undirected Rural Postman Problem
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
- Recent results on arc routing problems: an annotated bibliography
- A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
- OAR lib: an open source arc routing library
- A branch-and-price algorithm for the windy rural postman problem
- New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
This page was built for publication: New heuristic algorithms for the windy rural postman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387296)