1 citations · 1 across the 4 of their papers we have counts for
4 papers
Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty
Corinna Mathwieser, Eranda Cela
This article studies the Minimum Spanning Tree Problem under Explorable Uncertainty as well as a related vertex uncertainty version of the problem. We particularly consider special…
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…