Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121)
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: Improved algorithms for computing minmax regret sinks on dynamic path and tree networks |
scientific article; zbMATH DE number 6520518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved algorithms for computing minmax regret sinks on dynamic path and tree networks |
scientific article; zbMATH DE number 6520518 |
Statements
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (English)
0 references
11 December 2015
0 references
facility location
0 references
sink location problem
0 references
minmax regret optimization
0 references
robust solution
0 references
uncertain demand
0 references
0 references
0.9467673
0 references
0.90994084
0 references
0.90994084
0 references
0.90280145
0 references
0.9025111
0 references
0.90110934
0 references
0.90102303
0 references
0.9002535
0 references
