Modeling and solving several classes of arc routing problems as traveling salesman problems
From MaRDI portal
Publication:1374032
DOI10.1016/S0305-0548(97)00013-0zbMATH Open0889.90146MaRDI QIDQ1374032FDOQ1374032
Authors: G. Laporte 
Publication date: 2 December 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Recommendations
Cites Work
- Matching, Euler tours and the Chinese postman
- An algorithm for the Rural Postman problem on a directed graph
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- Capacitated arc routing problems
- Arc Routing Problems, Part II: The Rural Postman Problem
- An optimal algorithm for the mixed Chinese postman problem
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Title not available (Why is that?)
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
Cited In (21)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- A scheme for determining vehicle routes based on Arc-based service network design
- A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal
- Solving the time varying postman problems with timed automata
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- The aircraft maintenance base location problem
- The parking warden tour problem
- Exact solution of the generalized routing problem through graph transformations
- An ILP-refined tabu search for the directed profitable rural postman problem
- The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects
- The Rural Postman Problem on mixed graphs with turn penalties
- The time-dependent rural postman problem: polyhedral results
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
- Recent results on arc routing problems: an annotated bibliography
- Heuristics for a dynamic rural postman problem
- Solving the large-scale min-max \(k\)-rural postman problem for snow plowing
- Lower bounds and heuristics for the windy rural postman problem
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- Transforming arc routing into node routing problems
- Solving an urban waste collection problem using ants heuristics
This page was built for publication: Modeling and solving several classes of arc routing problems as traveling salesman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374032)
