On Threshold BDDs and the Optimal Variable Ordering Problem

DOI10.1007/978-3-540-73556-4_15zbMath1175.90324OpenAlexW1970860969MaRDI QIDQ3611963

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

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

Related Items

Incorporating bounds from decision diagrams into integer programming ⋮ Computing convex hulls and counting integer points with \texttt{polymake} ⋮ Theoretical insights and algorithmic tools for decision diagram-based optimization ⋮ Lagrangian bounds from decision diagrams ⋮ Characteristics of the maximal independent set ZDD ⋮ Compact representation of near-optimal integer programming solutions ⋮ Outer approximation for integer nonlinear programs via decision diagrams ⋮ On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem ⋮ On the size of (generalized) OBDDs for threshold functions ⋮ azove ⋮ 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

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