To stop or not to stop: a time-constrained trip covering location problem on a tree network (Q2675712)
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 7592265
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | To stop or not to stop: a time-constrained trip covering location problem on a tree network |
scientific article; zbMATH DE number 7592265 |
Statements
To stop or not to stop: a time-constrained trip covering location problem on a tree network (English)
0 references
26 September 2022
0 references
location
0 references
network
0 references
covering problem
0 references
mixed distances
0 references
0 references
0 references
0.8490920066833496
0 references
0.8351065516471863
0 references
0.833901584148407
0 references
0.8177011013031006
0 references
