1 citations · 1 across the 6 of their papers we have counts for
6 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…
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…
New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices
Eranda Cela, Vladimir Deineko, Gerhard J. Woeginger
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 sp…
Linearizable special cases of the QAP
Eranda Cela, Vladimir G. Deineko, Gerhard J. Woeginger
We consider special cases of the quadratic assignment problem (QAP) that are linearizable in the sense of Bookhold. We provide combinatorial characterizations of the linearizable i…
Well-solvable cases of the QAP with block-structured matrices
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
We investigate special cases of the quadratic assignment problem (QAP) where one of the two underlying matrices carries a simple block structure. For the special case where the sec…