The time-dependent rural postman problem: polyhedral results
From MaRDI portal
Publication:2867412
DOI10.1080/10556788.2012.666240zbMath1283.90035OpenAlexW1979086038MaRDI QIDQ2867412
Guangjian Hou, Jinghao Sun, Guozhen Tan
Publication date: 19 December 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2012.666240
Related Items
Solving the time varying postman problems with timed automata ⋮ The windy rural postman problem with a time-dependent zigzag option ⋮ An integer programming approach for the Chinese postman problem with time-dependent travel time
Cites Work
- Unnamed Item
- Test generation for interaction detection in feature-rich communication systems
- Arc routing problems with time-dependent service costs
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- A cutting plane algorithm for the windy postman problem
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- The mixed general routing polyhedron
- A branch-and-cut algorithm for the undirected rural postman problem
- Transforming arc routing into node routing problems
- Solving capacitated arc routing problems using a transformation to the CVRP
- Scheduling with time dependent processing times: Review and extensions
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Matching, Euler tours and the Chinese postman
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- An optimal algorithm for the mixed Chinese postman problem
- New Results on the Mixed General Routing Problem
