Linearizable special cases of the QAP
Optimization and Control
2014-09-24 v1 Data Structures and Algorithms
Abstract
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.
Cite
@article{arxiv.1409.6510,
title = {Linearizable special cases of the QAP},
author = {Eranda Cela and Vladimir G. Deineko and Gerhard J. Woeginger},
journal= {arXiv preprint arXiv:1409.6510},
year = {2014}
}
Comments
11 pages