Innovative cost allocation strategies for the shortest route relaxation of the set covering problem (Q2907709)
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: Innovative cost allocation strategies for the shortest route relaxation of the set covering problem |
scientific article; zbMATH DE number 6080584
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Innovative cost allocation strategies for the shortest route relaxation of the set covering problem |
scientific article; zbMATH DE number 6080584 |
Statements
11 September 2012
0 references
graph theoretic relaxation
0 references
set covering problem
0 references
shortest route
0 references
Innovative cost allocation strategies for the shortest route relaxation of the set covering problem (English)
0 references
0.9156939387321472
0 references
0.8570093512535095
0 references
0.8295756578445435
0 references
0.8135887384414673
0 references
0.8074480891227722
0 references
