The following pages link to azove (Q16804):
Displayed 12 items.
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams (Q531446) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- On the size of (generalized) OBDDs for threshold functions (Q987805) (← links)
- On the use of binary decision diagrams for solving problems on simple games (Q1926964) (← links)
- On finding the optimal BDD relaxation (Q2011572) (← links)
- Improving branch-and-bound using decision diagrams and reinforcement learning (Q2117248) (← links)
- Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
- Theoretical insights and algorithmic tools for decision diagram-based optimization (Q2398513) (← links)
- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem (Q3599068) (← links)
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances (Q5106421) (← links)
- 0/1 vertex and facet enumeration with BDDs (Q5233502) (← links)
- (Q5358292) (← links)