Ideal clutters (Q697573)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Ideal clutters |
scientific article; zbMATH DE number 1801735
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ideal clutters |
scientific article; zbMATH DE number 1801735 |
Statements
Ideal clutters (English)
0 references
17 September 2002
0 references
A clutter is a family \(F\) of subsets of a ground set \(V\) with the property that \(A\nsubseteq B\) for all distinct \(A,B\in F\). A clutter is ideal if \[ \bigl\{x\geq 0:x(A)\geq 1\text{ for all }A\in F\bigr\} \] is an integral polyhedron. The authors present the state of the art of the topic and pose open questions.
0 references
integer programming
0 references
ideal clutter
0 references
ideal matrix
0 references
set covering
0 references
integer polyhedron
0 references
width-length inequality
0 references
max flow min cut probperty
0 references
0 references
0.8516849
0 references
0.7841347
0 references
0.75542176
0 references
