2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/128781In 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.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.10Computational ComplexityDiscrete MathematicsF.2.2text