Dynamic minimum cost path problem with curfews (Q3402950)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5669962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic minimum cost path problem with curfews |
scientific article; zbMATH DE number 5669962 |
Statements
12 February 2010
0 references
shortest cost path
0 references
dynamic problem
0 references
curfews
0 references
0.8926504254341125
0 references
0.822818398475647
0 references
0.811621904373169
0 references
0.7981353998184204
0 references
