Time-constrained Chinese postman problems

DOI10.1016/S0898-1221(02)00156-6zbMath1067.90146MaRDI QIDQ1886476

Hsiao-Fan Wang, Yu-Pin Wen

Publication date: 18 November 2004

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

Chinese postman problemCrisp and fuzzy time window constraints

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Arc routing under uncertainty: introduction and literature review ⋮ Shortest path problems with left-side time windows ⋮ Arc routing problems: A review of the past, present, and future ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times ⋮ Eulerian walks in temporal graphs ⋮ Hierarchical Chinese postman problem with fuzzy travel times ⋮ A time-dependent hierarchical Chinese postman problem ⋮ Vehicle routing problem with fuzzy time windows ⋮ Uncertain multi-objective Chinese postman problem ⋮ An integer programming approach for the Chinese postman problem with time-dependent travel time ⋮ Königsberg sightseeing: Eulerian walks in temporal graphs

Cites Work

• A new algorithm for the directed Chinese postman problem
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• A fundamental problem in vehicle routing
• Matching, Euler tours and the Chinese postman
• Networks and vehicle routing for municipal waste collection
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item