The time-dependent rural postman problem: polyhedral results
From MaRDI portal
Publication:2867412
DOI10.1080/10556788.2012.666240zbMATH Open1283.90035OpenAlexW1979086038MaRDI QIDQ2867412FDOQ2867412
Authors: Guozhen Tan, Jinghao Sun, Guangjian Hou 
Publication date: 19 December 2013
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2012.666240
Recommendations
- An integer programming approach for the rural postman problem with time dependent travel times
- A branch-and-bound algorithm for the time-dependent rural postman problem
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- Chinese postman problem over 50 years
- A cutting plane heuristic algorithm for the time dependent Chinese postman problem
Cites Work
- Matching, Euler tours and the Chinese postman
- Title not available (Why is that?)
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- 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
- The mixed general routing polyhedron
- A branch-and-cut algorithm for the undirected rural postman problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- New Results on the Mixed General Routing Problem
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Scheduling with time dependent processing times: Review and extensions
- Arc routing problems with time-dependent service costs
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- Transforming arc routing into node routing problems
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- A cutting plane algorithm for the windy postman problem
- Test generation for interaction detection in feature-rich communication systems
Cited In (10)
- Solving the time varying postman problems with timed automata
- Variants of the mixed postman problem solvable using linear programming
- A branch-and-bound algorithm for the time-dependent rural postman problem
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
- An integer programming approach for the rural postman problem with time dependent travel times
- An updated annotated bibliography on arc routing problems
- The Rural Postman Problem on mixed graphs with turn penalties
- A cutting plane heuristic algorithm for the time dependent Chinese postman problem
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- The windy rural postman problem with a time-dependent zigzag option
This page was built for publication: The time-dependent rural postman problem: polyhedral results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867412)
