Mauricio G. C. Resende, K. G. Ramakrishnan, Zvi Drezner, Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming, Operations Research, Vol.

This class of problems includes the maximum generalized assignment problem (GAP) 1 and a distributed caching problem (DCP) described in this paper. Given a β-approximation algorithm for finding the ...