Worst case analysis of a class of set covering heuristics (Q3951908): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5675139 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation algorithms for combinatorial problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the ratio of optimal integral and fractional covers / rank | |||
Normal rank |
Latest revision as of 16:23, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Worst case analysis of a class of set covering heuristics |
scientific article |
Statements
Worst case analysis of a class of set covering heuristics (English)
0 references
1982
0 references
heuristic algorithms
0 references
set covering
0 references
worst case bounds
0 references
greedy heuristic
0 references
0 references