Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838)
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: Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions |
scientific article; zbMATH DE number 5324121
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions |
scientific article; zbMATH DE number 5324121 |
Statements
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (English)
0 references
10 September 2008
0 references
dualization
0 references
hypergraph transversals
0 references
generation algorithms
0 references
monotone systems of inequalities
0 references
linear inequalities
0 references
transversal inequalities
0 references
polymatroid inequalities
0 references
0 references
0 references
0 references
