Minimax regret 1-median problem in dynamic path networks (Q726099)
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: Minimax regret 1-median problem in dynamic path networks |
scientific article; zbMATH DE number 6631016
- Minimax Regret 1-Median Problem in Dynamic Path Networks
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimax regret 1-median problem in dynamic path networks |
scientific article; zbMATH DE number 6631016 |
|
Statements
Minimax regret 1-median problem in dynamic path networks (English)
0 references
Minimax Regret 1-Median Problem in Dynamic Path Networks (English)
0 references
3 August 2018
0 references
29 September 2016
0 references
minimax regret
0 references
sink location
0 references
dynamic flow
0 references
evacuation planning
0 references
0 references
0 references
0 references
0.93246007
0 references
0.92637897
0 references
0.9259021
0 references
0.90259814
0 references
0.9020794
0 references
0.89997417
0 references
0.8993727
0 references
0.8982238
0 references
