Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2015.07.009 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2015.07.009 / rank | |||
Normal rank | |||
Latest revision as of 07:34, 10 December 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
0 references
