On the Fractional Solution to the Set Covering Problem (Q3668305): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0604023 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066503336 / 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: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank | |||
Normal rank | |||
Latest revision as of 10:06, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Fractional Solution to the Set Covering Problem |
scientific article |
Statements
On the Fractional Solution to the Set Covering Problem (English)
0 references
1983
0 references
linear programming relaxation
0 references
worst case analysis
0 references
set covering
0 references
zero- one optimal value
0 references
fractional optimal value
0 references
gap
0 references
