Solving the Chinese postman problem on time varying networks with timed automata (Q2917150)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving the Chinese postman problem on time varying networks with timed automata |
scientific article; zbMATH DE number 6091516
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the Chinese postman problem on time varying networks with timed automata |
scientific article; zbMATH DE number 6091516 |
Statements
5 October 2012
0 references
time window
0 references
time dependent
0 references
Chinese postman problem
0 references
timed automata
0 references
Solving the Chinese postman problem on time varying networks with timed automata (English)
0 references
