Graph theoretic relaxations of set covering and set partitioning problems (Q1390264)
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 1175047
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph theoretic relaxations of set covering and set partitioning problems |
scientific article; zbMATH DE number 1175047 |
Statements
Graph theoretic relaxations of set covering and set partitioning problems (English)
0 references
14 July 1998
0 references
graph theoretic relaxations
0 references
set covering
0 references
set partitioning
0 references
network relaxation
0 references
greedy method
0 references
assignment
0 references
shortest route
0 references
minimum spanning tree
0 references
0 references
0 references
0 references
0.8872938752174377
0 references
0.8570093512535095
0 references
0.8062401413917542
0 references
