1 citations · 1 across the 4 of their papers we have counts for
5 papers
Envelope Cubic Regularized Newton Method for Nonconvex-Strongly-Concave Minimax Optimization
Qihao Zhou, Lesi Chen, Luo Luo +1
We study nonconvex-strongly-concave minimax problem in which the objective has $ρ…
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…
Graph Neural Networks with Triangle-Based Messages for the Multicut Problem
Jannik Irmai, Lucas Fabian Naumann, Bjoern Andres
The multicut problem is an NP-hard combinatorial optimization problem with diverse applications in fields such as bioinformatics, data mining and computer vision. Graph neural netw…
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…
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…