Abstract
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 ≤ 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.
Author supplied keywords
Cite
CITATION STYLE
Bohn, A., Faenza, Y., Fiorini, S., Fisikopoulos, V., Macchia, M., & Pashkovich, K. (2015). Enumeration of 2-level polytopes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9294, pp. 191–202). Springer Verlag. https://doi.org/10.1007/978-3-662-48350-3_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
