A note on some computationally difficult set covering problems (Q3867546)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3670176
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on some computationally difficult set covering problems |
scientific article; zbMATH DE number 3670176 |
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
