The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5842695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minmax regret gradual covering location problem on a network with incomplete information of demand weights |
scientific article; zbMATH DE number 5842695 |
Statements
The minmax regret gradual covering location problem on a network with incomplete information of demand weights (English)
0 references
28 January 2011
0 references
location
0 references
network
0 references
gradual covering location
0 references
minmax regret
0 references
incomplete information
0 references
0.8818228244781494
0 references
0.8505300879478455
0 references
0.8246164917945862
0 references
0.820303201675415
0 references
0.8163476586341858
0 references
