0/1 vertex and facet enumeration with BDDs

DOI10.1137/1.9781611972870.15zbMath1427.68330MaRDI QIDQ5233502

Friedrich Eisenbrand, Markus Behle

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

Mathematics Subject Classification ID

52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)

52B55: Computational aspects related to convexity

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68P05: Data structures

Related Items

Counting Solutions of Integer Programs Using Unrestricted Subtree Detection

Uses Software

• azove