An integer programming approach for the Chinese postman problem with time-dependent travel time
From MaRDI portal
Publication:2343981
DOI10.1007/s10878-014-9755-8zbMath1322.90080OpenAlexW2029639072MaRDI QIDQ2343981
Guozhen Tan, Jinghao Sun, Yakun Meng
Publication date: 11 May 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9755-8
valid inequalitiespolyhedral combinatoricsChinese postman problemtime-dependentcycle-path formulation
Related Items (3)
On path ranking in time-dependent graphs ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ A time-dependent hierarchical Chinese postman problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Test generation for interaction detection in feature-rich communication systems
- Arc routing problems with time-dependent service costs
- A cutting plane algorithm for the windy postman problem
- Routeing winter gritting vehicles
- 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
- Time-constrained Chinese postman problems
- A constraint programming approach to the Chinese postman problem with time windows
- Solving capacitated arc routing problems using a transformation to the CVRP
- The time-dependent rural postman problem: polyhedral results
- An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times
- Finding minimum-cost circulations by canceling negative cycles
- 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
- Formal Approaches to Software Testing
- Testing timed automata
This page was built for publication: An integer programming approach for the Chinese postman problem with time-dependent travel time
