Solving the maximal covering location problem with heuristic concentration (Q2384889)
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 5199596
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the maximal covering location problem with heuristic concentration |
scientific article; zbMATH DE number 5199596 |
Statements
Solving the maximal covering location problem with heuristic concentration (English)
0 references
10 October 2007
0 references
Heuristic concentration
0 references
maximal covering location problem and heuristic
0 references
0 references
0.8254320025444031
0 references
0.8019896745681763
0 references
0.7850579023361206
0 references
0.7765670418739319
0 references
0.7699657678604126
0 references
