A modified greedy heuristic for the set covering problem with improved worst case bound (Q1334632)
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: A modified greedy heuristic for the set covering problem with improved worst case bound |
scientific article; zbMATH DE number 643651
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A modified greedy heuristic for the set covering problem with improved worst case bound |
scientific article; zbMATH DE number 643651 |
Statements
A modified greedy heuristic for the set covering problem with improved worst case bound (English)
0 references
25 September 1994
0 references
set covering problems
0 references
greedy algorithm
0 references
