The gradual covering decay location problem on a network. (Q1410306)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The gradual covering decay location problem on a network. |
scientific article; zbMATH DE number 1992598
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The gradual covering decay location problem on a network. |
scientific article; zbMATH DE number 1992598 |
Statements
The gradual covering decay location problem on a network. (English)
0 references
14 October 2003
0 references
Location
0 references
Networks
0 references
Integer programming
0 references
Maximal cover problems
0 references
0.9198902
0 references
0.89181805
0 references
0.8867602
0 references
0.8809947
0 references
0.87594783
0 references
0.8675615
0 references
0.8658316
0 references
0.86299247
0 references
0.8576001
0 references