An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times

DOI10.1007/978-3-642-22685-4_37zbMath1286.90098OpenAlexW28360702MaRDI QIDQ3087968

Guozhen Tan, Jinghao Sun

Publication date: 17 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_37

zbMATH Keywords

rural postman problemvalid inequalitiespolyhedral combinatoricstime dependentarc-path formulation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

A branch-and-bound algorithm for the time-dependent rural postman problem ⋮ On path ranking in time-dependent graphs ⋮ Arc routing problems: A review of the past, present, and future ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ An integer programming approach for the Chinese postman problem with time-dependent travel time

This page was built for publication: An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times