The time-dependent rural postman problem: polyhedral results

DOI10.1080/10556788.2012.666240MaRDI QIDQ2867412zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

polyhedral combinatoricstime-dependentvalid inequalitiesrural postman problemarc-path formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

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

• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• A branch-and-cut algorithm for the undirected rural postman problem
• A cutting plane algorithm for the windy postman problem
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
• An optimal algorithm for the mixed Chinese postman problem
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Arc routing problems with time-dependent service costs
• Matching, Euler tours and the Chinese postman
• Modeling and solving several classes of arc routing problems as traveling salesman problems
• New Results on the Mixed General Routing Problem
• Scheduling with time dependent processing times: Review and extensions
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Single machine scheduling with start time dependent processing times: Some solvable cases
• Solving capacitated arc routing problems using a transformation to the CVRP
• Test generation for interaction detection in feature-rich communication systems
• The mixed general routing polyhedron
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• Transforming arc routing into node routing problems

Cited in

(10)

• A branch-and-bound algorithm for the time-dependent rural postman problem
• The Rural Postman Problem on mixed graphs with turn penalties
• A cutting plane heuristic algorithm for the time dependent Chinese postman problem
• Solving the time varying postman problems with timed automata
• An integer programming approach for the rural postman problem with time dependent travel times
• 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
• Variants of the mixed postman problem solvable using linear programming
• An updated annotated bibliography on arc routing problems
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm

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)