Network-based formulations of the quadratic assignment problem

We present two formulations of the Quadratic Assignment Problem (QAP) that result in network flow problems with integer variables and side constraints. A linerarization of the QAP is obtained in both cases by considering each facility to consist of two parts – a source for all outgoing flows from that facility, and a sink for all incoming flows to the facility. Preliminary computational experience with both approaches is presented.