6 citations · 8 across the 12 of their papers we have counts for
6 papers · 1 filter
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…
The data arrangement problem on binary trees
Eranda Cela, Joachim Schauer, Rostislav Stanek
The data arrangement problem on regular trees (DAPT) consists in assigning the vertices of a given graph G, called the guest graph, to the leaves of a d-regular tree T, called the…
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…
Heuristics for the data arrangement problem on regular trees
Eranda Cela, Rostislav Stanek
The data arrangement problem on regular trees (DAPT) consists in assigning the vertices of a given graph G to the leaves of a d-regular tree T such that the sum of the pairwise dis…
The Wiener maximum quadratic assignment problem
Eranda Çela, Nina S. Schmuck, Shmuel Wimer +1
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poin…