Algorithm Class: Lattice-point enumeration via threshold BDDs (0/1-polytopes) (Q6825925)
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:
Counting/enumerating 0/1 points in polytopes using Binary Decision Diagrams, with emphasis on variable-ordering heuristics for compact representations.
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm Class: Lattice-point enumeration via threshold BDDs (0/1-polytopes) |
Counting/enumerating 0/1 points in polytopes using Binary Decision Diagrams, with emphasis on variable-ordering heuristics for compact representations. |
