Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Klinz, Bettina"'
An instance of the NP-hard Quadratic Shortest Path Problem (QSPP) is called linearizable iff it is equivalent to an instance of the classic Shortest Path Problem (SPP) on the same input digraph. The linearization problem for the QSPP (LinQSPP) decide
Externí odkaz:
http://arxiv.org/abs/2303.00569
In the bipartite travelling salesman problem (BTSP), we are given $n=2k$ cities along with an $n\times n$ distance matrix and a partition of the cities into $k$ red and $k$ blue cities. The task is to find a shortest tour which alternately visits blu
Externí odkaz:
http://arxiv.org/abs/2302.05161
We consider the NP-hard 2-period balanced travelling salesman problem. In this problem the salesman needs to visit a set of customers in two time periods. A given subset of the customers has to be visited in both periods while the rest of the custome
Externí odkaz:
http://arxiv.org/abs/2203.06090
Publikováno v:
In Electric Power Systems Research May 2024 230
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.
Autor:
Deineko, Vladimir, Klinz, Bettina
We consider a 2-vehicle routing problem (2VRP) which can be viewed as a building block for the variety of vehicle routing problems (VRP). As a simplified version of the 2VRP, we consider a 2-period balanced travelling salesman problem (2TSP) and desc
Externí odkaz:
http://arxiv.org/abs/1802.08042
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.
We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coefficients are the perimeters of the corresponding triangles measured acc
Externí odkaz:
http://arxiv.org/abs/1409.0845
Given an $n\times n\times p$ cost array $C$ we consider the problem $p$-P3AP which consists in finding $p$ pairwise disjoint permutations $\varphi_1,\varphi_2,\ldots,\varphi_p$ of $\{1,\ldots,n\}$ such that $\sum_{k=1}^{p}\sum_{i=1}^nc_{i\varphi_k(i)
Externí odkaz:
http://arxiv.org/abs/1405.5210
Autor:
Ćustić, Ante, Klinz, Bettina
Given a combinatorial optimization problem, we aim at characterizing the set of all instances for which every feasible solution has the same objective value. Our central result deals with multi-dimensional assignment problems. We show that for the ax
Externí odkaz:
http://arxiv.org/abs/1405.6096