What is the best greedy-like heuristic for the weighted set covering problem? (Q1790196): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OR-Library / rank | |||
Normal rank | |||
Revision as of 23:21, 29 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
