Enumeration technique for set covering problems: a combinatorial approach (Q5756413): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: A Greedy Heuristic for the Set-Covering Problem / rank | |||
Normal rank | |||
Latest revision as of 13:44, 26 June 2024
scientific article; zbMATH DE number 5187076
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumeration technique for set covering problems: a combinatorial approach |
scientific article; zbMATH DE number 5187076 |
Statements
Enumeration technique for set covering problems: a combinatorial approach (English)
0 references
4 September 2007
0 references
integer programming problems
0 references
multi-objective programming
0 references
combinatroics
0 references
