New heuristic algorithms for the windy rural postman problem
DOI10.1016/J.COR.2004.04.007zbMATH Open1178.90332OpenAlexW2043392035MaRDI QIDQ2387296FDOQ2387296
Authors: Enrique Benavent, Estefanía Piñana, Isaac Plana, Ángel Corberán, José M. Sanchis 
Publication date: 2 September 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/94488
Recommendations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- Fundamentals of scatter search and path relinking
- A GRASP heuristic for the mixed Chinese postman problem
- Scatter search. Methodology and implementation in C. With CD-ROM.
- 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
- Improvement Procedures for the Undirected Rural Postman Problem
- Title not available (Why is that?)
- The Chinese Postman Problem for Mixed Networks
- Title not available (Why is that?)
- On the windy postman problem
- On the windy postman problem on Eulerian graphs
- A cutting plane algorithm for the windy postman problem
- Algorithms for the windy postman problem
- Lower bounds and heuristics for the windy rural postman problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
- OAR lib: an open source arc routing library
- A branch-and-price algorithm for the windy rural postman problem
- Improvement Procedures for the Undirected Rural Postman Problem
- A metaheuristic for the min-max windy rural postman problem with K vehicles
- A new view on rural postman based on Eulerian extension and matching
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
- The single robot line coverage problem: Theory, algorithms, and experiments
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
- Recent results on arc routing problems: an annotated bibliography
- Plowing with precedence in polynomial time
- On the windy postman problem
- A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
- Aesthetic considerations for the min-max \(K\)-windy rural postman problem
- Lower bounds and heuristics for the windy rural postman problem
Uses Software
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)
