1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2026
The canonical facets of multi-separator polytopes
Bjoern Andres, Silvia Di Gregorio, Jannik Irmai +2
We initiate a polyhedral study of the graph multi-separator problem proposed by Irmai et al. (2024) as an alternative to the lifted multicut problem for application to the task of…
cs.DM2024★ 1 cited
Chorded cycle facets of the clique partitioning polytope
Jannik Irmai, Lucas Fabian Naumann, Bjoern Andres
The -chorded -cycle inequalities are a class of valid inequalities for the clique partitioning polytope. It is known that for , these inequalitie…
cs.DM2024
Box Facets and Cut Facets of Lifted Multicut Polytopes
Lucas Fabian Naumann, Jannik Irmai, Shengxian Zhao +1
The lifted multicut problem is a combinatorial optimization problem whose feasible solutions relate one-to-one to the decompositions of a graph . Given an augmentation…