18 citations · 72 across the 24 of their papers we have counts for
8 papers · 1 filter
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…
Geometric versions of the 3-dimensional assignment problem under general norms
Ante Ćustić, Bettina Klinz, Gerhard J. Woeginger
We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coeff…
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Robert Bredereck, Jiehua Chen, Piotr Faliszewski +3
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (…
Planar 3-dimensional assignment problems with Monge-like cost arrays
Ante Ćustić, Bettina Klinz, Gerhard J. Woeginger
Given an cost array we consider the problem -P3AP which consists in finding pairwise disjoint permutations of s…
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…
Network-Based Vertex Dissolution
René van Bevern, Robert Bredereck, Jiehua Chen +3
We introduce a graph-theoretic vertex dissolution model that applies to a number of redistribution scenarios such as gerrymandering in political districting or work balancing in an…