Linearizable special cases of the QAP
Not on the map. Why?
Abstract (arXiv)
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 instances of the weighted feedback arc set QAP, and of the linearizable instances of the traveling salesman QAP. As a by-product, this yields a new well-solvable special case of the weighted feedback arc set problem.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 23 Sep 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.