Improved solutions to the Steiner triple covering problem (Q293185): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6590665 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorial problems | |||
Property / zbMATH Keywords: combinatorial problems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
set covering problems | |||
Property / zbMATH Keywords: set covering problems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Steiner triple systems | |||
Property / zbMATH Keywords: Steiner triple systems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
width of matrices | |||
Property / zbMATH Keywords: width of matrices / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on some computationally difficult set covering problems / 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: A probabilistic heuristic for a computationally difficult set covering problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Greedy randomized adaptive search procedures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Widths and Heights of (0,1) -Matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiplicities and Minimal Widths for (0, 1)-Matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Width Sequences for Special Classes of (0, 1)-Matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4124603 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592263 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An interior point algorithm to solve computationally difficult set covering problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving hard set covering problems / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:37, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Improved solutions to the Steiner triple covering problem |
scientific article |
Statements
Improved solutions to the Steiner triple covering problem (English)
0 references
9 June 2016
0 references
combinatorial problems
0 references
set covering problems
0 references
Steiner triple systems
0 references
width of matrices
0 references