What is the best greedy-like heuristic for the weighted set covering problem? (Q1790196)
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: What is the best greedy-like heuristic for the weighted set covering problem? |
scientific article; zbMATH DE number 6946094
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | What is the best greedy-like heuristic for the weighted set covering problem? |
scientific article; zbMATH DE number 6946094 |
Statements
What is the best greedy-like heuristic for the weighted set covering problem? (English)
0 references
2 October 2018
0 references
heuristics
0 references
weighted set covering problem
0 references
greedy algorithms
0 references
column knowledge functions
0 references
row knowledge functions
0 references
0 references
