Minmax regret location--allocation problem on a network under uncertainty (Q864020): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 97 / rank | |||
Normal rank | |||
Revision as of 05:21, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minmax regret location--allocation problem on a network under uncertainty |
scientific article |
Statements
Minmax regret location--allocation problem on a network under uncertainty (English)
0 references
12 February 2007
0 references
location problems
0 references
polynomial algorithms
0 references
complexity
0 references
robust optimization
0 references
