azove

swMATH4634MaRDI QIDQ16804FDOQ16804

Author name not available (Why is that?)

Described by source

• On threshold BDDs and the optimal variable ordering problem
• On Threshold BDDs and the Optimal Variable Ordering Problem

Cited In (12)

• 0/1 vertex and facet enumeration with BDDs
• Theoretical insights and algorithmic tools for decision diagram-based optimization
• Improving branch-and-bound using decision diagrams and reinforcement learning
• On finding the optimal BDD relaxation
• Computing convex hulls and counting integer points with \texttt{polymake}
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
• Title not available (Why is that?)
• On the use of binary decision diagrams for solving problems on simple games
• On the size of (generalized) OBDDs for threshold functions
• Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
• Forms of representation for simple games: sizes, conversions and equivalences
• On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem

This page was built for software: azove