What is the best greedy-like heuristic for the weighted set covering problem? (Q1790196): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:24, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | What is the best greedy-like heuristic for the weighted set covering problem? |
scientific article |
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
