Solving the time varying postman problems with timed automata
From MaRDI portal
Recommendations
- Solving the Chinese postman problem on time varying networks with timed automata
- Decomposition of timed automata for solving scheduling problems
- Formal Methods for the Design of Real-Time Systems
- Lectures on Concurrency and Petri Nets
- Scheduling with timed automata
- Tools and Algorithms for the Construction and Analysis of Systems
- scientific article; zbMATH DE number 2102690
- scientific article; zbMATH DE number 6300098
Cites work
- A constraint programming approach to the Chinese postman problem with time windows
- A cutting plane heuristic algorithm for the time dependent Chinese postman problem
- A theory of timed automata
- Arc routing problems with time-dependent service costs
- Arc Routing Problems, Part II: The Rural Postman Problem
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- Routeing winter gritting vehicles
- Scheduling with timed automata
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Solving capacitated arc routing problems using a transformation to the CVRP
- Solving the Chinese postman problem on time varying networks with timed automata
- Test generation for interaction detection in feature-rich communication systems
- The time-dependent rural postman problem: polyhedral results
- Transforming arc routing into node routing problems
This page was built for publication: Solving the time varying postman problems with timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3458818)
