Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem
Computational Complexity
2007-05-23 v9 Discrete Mathematics
Abstract
In this paper, we present a polynomial-sized linear programming formulation of the Quadratic Assignment Problem (QAP). The proposed linear program is a network flow-based model. Hence, it provides for the solution of the QAP in polynomial time. Computational testing and results are discussed.
Cite
@article{arxiv.cs/0609004,
title = {Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem},
author = {Moustapha Diaby},
journal= {arXiv preprint arXiv:cs/0609004},
year = {2007}
}
Comments
6 pages; Published in the 2006 IMECS Conference Proceedings (ISBN: 988 98671-3-3); Hofman's claimed "counter-example" is invalid: violates set of constraints 2.10