Algorithms - ESA 2015 pp 191-202
Enumeration of 2-Level Polytopes
- Cite this paper as:
- Bohn A., Faenza Y., Fiorini S., Fisikopoulos V., Macchia M., Pashkovich K. (2015) Enumeration of 2-Level Polytopes. In: Bansal N., Finocchi I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science, vol 9294. Springer, Berlin, Heidelberg
We propose the first algorithm for enumerating all combinatorial types of 2-level polytopes of a given dimension d, and provide complete experimental results for \(d \leqslant 6\). Our approach is based on the notion of a simplicial core, that allows us to reduce the problem to the enumeration of the closed sets of a discrete closure operator, along with some convex hull computations and isomorphism tests.
KeywordsPolyhedral computation Optimization Formal concept analysis
Unable to display preview. Download preview PDF.