Lower bounds and heuristics for the windy rural postman problem
DOI10.1016/J.EJOR.2005.09.021zbMATH Open1103.90095OpenAlexW2060202476MaRDI QIDQ852946FDOQ852946
Authors: Enrique Benavent, Alessandro Carrotta, Ángel Corberán, Daniele Vigo, José M. Sanchis 
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.021
Recommendations
- New heuristic algorithms for the windy rural postman problem
- Algorithms for the windy postman problem
- A branch & cut algorithm for the windy general routing problem and special cases
- A branch-and-cut algorithm for the profitable windy rural postman problem
- A cutting plane algorithm for the windy postman problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- An algorithm for the Rural Postman problem on a directed graph
- Title not available (Why is that?)
- Arc Routing Problems, Part II: The Rural Postman Problem
- New inequalities for the general routing problem
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
- A polyhedral approach to the rural postman problem
- The general routing polyhedron: A unifying framework
- Odd Minimum Cut-Sets and b-Matchings
- Title not available (Why is that?)
- A cutting plane algorithm for the general routing problem
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (22)
- An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances
- New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
- A branch-and-price algorithm for the windy rural postman problem
- New heuristic algorithms for the windy rural postman problem
- Solving the close-enough arc routing problem
- A metaheuristic for the min-max windy rural postman problem with K vehicles
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
- The single robot line coverage problem: Theory, algorithms, and experiments
- A branch & cut algorithm for the windy general routing problem and special cases
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
- The generalized arc routing problem
- A scatter search algorithm for time-dependent prize-collecting arc routing problems
- Recent results on arc routing problems: an annotated bibliography
- Plowing with precedence in polynomial time
- A branch-and-cut algorithm for the windy profitable location rural postman problem
- On the windy postman problem
- Heuristics for a dynamic rural postman problem
- A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
- Min-Max \(K\)-vehicles windy rural postman problem
- A cutting plane algorithm for the windy postman problem
- New results on the windy postman problem
This page was built for publication: Lower bounds and heuristics 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 Q852946)
