Zobrazeno 1 - 10
of 123
pro vyhledávání: '"Deineko, Vladimir"'
We solve the recognition problem (RP) for the class of Demidenko matrices. Our result closes a remarkable gap in the recognition of specially structured matrices. Indeed, the recognition of permuted Demidenko matrices is a longstanding open problem,
Externí odkaz:
http://arxiv.org/abs/2302.05191
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 Discrete Applied Mathematics 15 September 2024 354:3-14
In the path version of the Travelling Salesman Problem (Path-TSP), a salesman is looking for the shortest Hamiltonian path through a set of n cities. The salesman has to start his journey at a given city s, visit every city exactly once, and finally
Externí odkaz:
http://arxiv.org/abs/2009.14746
Publikováno v:
In European Journal of Operational Research 1 October 2023 310(1):168-184
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
Autor:
Deineko, Vladimir
In this paper we consider a 2-vehicle routing problem which can be viewed as a building block for the varieties of the vehicle routing problems (VRPs). To approach this problem, we suggest a framework based on the Held and Karp dynamic programming al
Externí odkaz:
http://arxiv.org/abs/1610.01876
We consider new polynomially solvable cases of the well-known Quadratic Assignment Problem involving coefficient matrices with a special diagonal structure. By combining the new special cases with polynomially solvable special cases known in the lite
Externí odkaz:
http://arxiv.org/abs/1609.06223