Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem
<|reference_start|>Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem: 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.<|reference_end|>
@article{diaby2006equality,
    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={2006},
    archivePrefix={arXiv},
    eprint={cs/0609004},
    primaryClass={cs.CC cs.DM}
}