Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1093958314 / rank | |||
Normal rank | |||
Revision as of 14:31, 19 March 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
