Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Irmai, Jannik"'
The $q$-chorded $k$-cycle inequalities are a class of valid inequalities for the clique partitioning polytope. It is known that for $q = 2$ or $q = \tfrac{k-1}{2}$, these inequalities induce facets of the clique partitioning polytope if and only if $
Externí odkaz:
http://arxiv.org/abs/2411.03407
We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack, while the follower chooses a feasible packing maximizing his own profit. The leader’s aim is to optimize a linear objective function in the ca
Externí odkaz:
https://tud.qucosa.de/id/qucosa%3A89005
https://tud.qucosa.de/api/qucosa%3A89005/attachment/ATT-0/
https://tud.qucosa.de/api/qucosa%3A89005/attachment/ATT-0/
The lifted multicut problem is a combinatorial optimization problem whose feasible solutions relate one-to-one to the decompositions of a graph $G = (V, E)$. Given an augmentation $\widehat{G} = (V, E \cup F)$ of $G$ and given costs $c \in \mathbb{R}
Externí odkaz:
http://arxiv.org/abs/2402.16814
We introduce a lower bounding technique for the min max correlation clustering problem and, based on this technique, a combinatorial 4-approximation algorithm for complete graphs. This improves upon the previous best known approximation guarantees of
Externí odkaz:
http://arxiv.org/abs/2310.09196
We propose a novel abstraction of the image segmentation task in the form of a combinatorial optimization problem that we call the multi-separator problem. Feasible solutions indicate for every pixel whether it belongs to a segment or a segment separ
Externí odkaz:
http://arxiv.org/abs/2307.04592
Fundamental to many applications in data analysis are the decompositions of a graph, i.e. partitions of the node set into component-inducing subsets. One way of encoding decompositions is by multicuts, the subsets of those edges that straddle distinc
Externí odkaz:
http://arxiv.org/abs/2202.08068
Autor:
Swoboda, Paul, Andres, Bjoern, Hornakova, Andrea, Bernard, Florian, Irmai, Jannik, Roetzer, Paul, Savchynskyy, Bogdan, Stein, David, Abbas, Ahmed
Structured prediction problems are one of the fundamental tools in machine learning. In order to facilitate algorithm development for their numerical solution, we collect in one place a large number of datasets in easy to read formats for a diverse s
Externí odkaz:
http://arxiv.org/abs/2202.03574
Publikováno v:
Journal of Optimization Theory and Applications 194(2), 521-542 (2022)
We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack, while the follower chooses a feasible packing maximizing his own profit. The leader's aim is to optimize a linear objective function in the capa
Externí odkaz:
http://arxiv.org/abs/2108.12303
Publikováno v:
In Discrete Optimization February 2023 47
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.