Time-constrained Chinese postman problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4095388 (Why is no real title available?)
- scientific article; zbMATH DE number 53892 (Why is no real title available?)
- scientific article; zbMATH DE number 3596873 (Why is no real title available?)
- A fundamental problem in vehicle routing
- A new algorithm for the directed Chinese postman problem
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Matching, Euler tours and the Chinese postman
- Networks and vehicle routing for municipal waste collection
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
Cited in
(16)- scientific article; zbMATH DE number 3880464 (Why is no real title available?)
- A time-dependent hierarchical Chinese postman problem
- Solving the Chinese postman problem on time varying networks with timed automata
- Shortest path problems with left-side time windows
- Arc routing problems: A review of the past, present, and future
- Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times
- A constraint programming approach to the Chinese postman problem with time windows
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
- Hierarchical Chinese postman problem with fuzzy travel times
- Arc routing under uncertainty: introduction and literature review
- scientific article; zbMATH DE number 6741960 (Why is no real title available?)
- Uncertain multi-objective Chinese postman problem
- Vehicle routing problem with fuzzy time windows
- Königsberg sightseeing: Eulerian walks in temporal graphs
- Eulerian walks in temporal graphs
- An integer programming approach for the Chinese postman problem with time-dependent travel time
This page was built for publication: Time-constrained Chinese postman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886476)
