On Threshold BDDs and the Optimal Variable Ordering Problem

DOI10.1007/978-3-540-73556-4_15MaRDI QIDQ3611963zbMATH OpenOpenAlexFDO

Authors Markus Behle

Publication date 3 March 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73556-4_15

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorial optimization (90C27)

Recommendations

• On threshold BDDs and the optimal variable ordering problem
• On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
• Improving the variable ordering of OBDDs is NP-complete
• On the effect of local changes in the variable ordering of ordered decision diagrams
• Optimal ordered binary decision diagrams for read-once formulas

Cited in

(15)

• On threshold BDDs and the optimal variable ordering problem
• azove
• Outer approximation for integer nonlinear programs via decision diagrams
• A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
• Improving branch-and-bound using decision diagrams and reinforcement learning
• Compact representation of near-optimal integer programming solutions
• Computing convex hulls and counting integer points with \texttt{polymake}
• Theoretical insights and algorithmic tools for decision diagram-based optimization
• On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
• Cost-Bounded Binary Decision Diagrams for 0-1 Programming
• Characteristics of the maximal independent set ZDD
• Experimental and Efficient Algorithms
• Incorporating bounds from decision diagrams into integer programming
• Lagrangian bounds from decision diagrams
• On the size of (generalized) OBDDs for threshold functions

This page was built for publication: On Threshold BDDs and the Optimal Variable Ordering Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611963)