A note on some computationally difficult set covering problems (Q3867546): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Determining the Stability Number of a Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4152212 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4124603 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5675139 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Improved Implicit Enumeration Approach for Integer Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Determining the Chromatic Number of a Graph / rank | |||
Normal rank | |||
Latest revision as of 04:37, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on some computationally difficult set covering problems |
scientific article |
Statements
A note on some computationally difficult set covering problems (English)
0 references
1980
0 references
set covering problems
0 references
linear programming relaxation
0 references
lower bounds, Steiner triple systems
0 references
0-1 programming
0 references
computationally difficult problems
0 references
combinatorial optimization
0 references
branch-and-bound method
0 references
computational complexity
0 references
