0/1 vertex and facet enumeration with BDDs
From MaRDI portal
Publication:5233502
DOI10.1137/1.9781611972870.15zbMath1427.68330OpenAlexW1537788028MaRDI QIDQ5233502
Markus Behle, Friedrich Eisenbrand
Publication date: 11 September 2019
Published in: 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611972870.15
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (7)
Petri Net Reductions for Counting Markings ⋮ Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems ⋮ Characteristics of the maximal independent set ZDD ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ Counting Solutions of Integer Programs Using Unrestricted Subtree Detection ⋮ Decision Diagram Decomposition for Quadratically Constrained Binary Optimization ⋮ A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
Uses Software
This page was built for publication: 0/1 vertex and facet enumeration with BDDs
