Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:27, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved algorithms for computing minmax regret sinks on dynamic path and tree networks |
scientific article |
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
