The article discusses the facet analysis of lifted multicut polytopes, focusing on lower cube inequalities and cut inequalities. It addresses necessary, sufficient, and efficiently decidable conditions for defining facets in these polytopes. The content is structured into sections covering the introduction, related work, preliminaries, characterization of lower cube facets, and NP-hardness of deciding cut facets. Key insights include the application of linear programming algorithms to understand convex hulls and polytopes in real affine spaces.
To Another Language
from source content
arxiv.org
Viktige innsikter hentet fra
by Lucas Fabian... klokken arxiv.org 03-20-2024
https://arxiv.org/pdf/2402.16814.pdfDypere Spørsmål