• Citer

Enumeration of 2-level polytopes

par Bohn, Adam ;Faenza, Yuri;Fiorini, Samuel ;Fisikopoulos, Vissarion ;Macchia, Marco ;Pashkovich, Kanstantsin
Référence Lecture notes in computer science, 9294, page (191-202)
Publication Publié, 2015

Article révisé par les pairs

• Détails
• Contenu

Résumé :

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.