What is the best greedy-like heuristic for the weighted set covering problem? (Q1790196): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2016.03.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2311739387 / rank | |||
Normal rank | |||
Revision as of 22:26, 19 March 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
