Zobrazeno 1 - 10
of 196
pro vyhledávání: '"Sinnl, Markus"'
The orienteering problem is a well-studied and fundamental problem in transportation science. In the problem, we are given a graph with prizes on the nodes and lengths on the edges, together with a budget on the overall tour length. The goal is to fi
Externí odkaz:
http://arxiv.org/abs/2407.02959
The COVID-19 pandemic has been a recent example for the spread of a harmful contagion in large populations. Moreover, the spread of harmful contagions is not only restricted to an infectious disease, but is also relevant to computer viruses and malwa
Externí odkaz:
http://arxiv.org/abs/2303.12402
Autor:
Gaar, Elisabeth, Sinnl, Markus
The discrete $\alpha$-neighbor $p$-center problem (d-$\alpha$-$p$CP) is an emerging variant of the classical $p$-center problem which recently got attention in literature. In this problem, we are given a discrete set of points and we need to locate $
Externí odkaz:
http://arxiv.org/abs/2211.12908
We study a class of integer bilevel programs with second-order cone constraints at the upper-level and a convex-quadratic objective function and linear constraints at the lower-level. We develop disjunctive cuts (DCs) to separate bilevel-infeasible s
Externí odkaz:
http://arxiv.org/abs/2207.05014
Many real-world optimisation problems involve multiple objectives. When considered concurrently, they give rise to a set of optimal trade-off solutions, also known as efficient solutions. These solutions have the property that neither objective can b
Externí odkaz:
http://arxiv.org/abs/2205.03386
Publikováno v:
In Computers and Operations Research July 2024 167
A fortification game (FG) is a three-level, two-player Stackelberg game, also known as defender-attacker-defender game, in which at the uppermost level, the defender selects some assets to be protected from potential malicious attacks. At the middle
Externí odkaz:
http://arxiv.org/abs/2111.13400
We study a class of bilevel integer programs with second-order cone constraints at the upper level and a convex quadratic objective and linear constraints at the lower level. We develop disjunctive cuts to separate bilevel infeasible points using a s
Externí odkaz:
http://arxiv.org/abs/2111.06824
Autor:
Chromý, Miloš, Sinnl, Markus
In the Minimum Common String Partition Problem (MCSP), we are given two strings on input, and we want to partition both into the same collection of substrings, minimizing the number of the substrings in the partition. This combinatorial optimization
Externí odkaz:
http://arxiv.org/abs/2110.05168
Autor:
Gaar, Elisabeth, Sinnl, Markus
The $p$-center problem (pCP) is a fundamental problem in location science, where we are given customer demand points and possible facility locations, and we want to choose $p$ of these locations to open a facility such that the maximum distance of an
Externí odkaz:
http://arxiv.org/abs/2108.07045