2 citations · 5 across the 12 of their papers we have counts for
14 papers
Recognising permuted Demidenko matrices
Eranda Çela, Vladimir Deineko, Gerhard J. Woeginger
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 recog…
The bipartite travelling salesman problem: A pyramidally solvable case
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
In the bipartite travelling salesman problem (BTSP), we are given cities along with an distance matrix and a partition of the cities into red and blue ci…
2-Period Balanced Travelling Salesman Problem: a polynomially solvable case and heuristics
Vladimir Deineko, Bettina Klinz, Mengke Wang
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 cus…
Travelling salesman paths on Demidenko matrices
Eranda Cela, Vladimir G. Deineko, Gerhard J. Woeginger
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…
2VRP: a benchmark problem for small but rich VRPs
Vladimir Deineko, Bettina Klinz
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 co…
A framework for small but rich vehicle routing problems
Vladimir Deineko
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…