Search Results - subject:"Quadratic assignment problem (QAP)"

Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting

Peng, Jiming; Zhu, Tao; Luo, Hezhi; Toh, Kim-Chuan - In: Computational Optimization and Applications 60 (2015) 1, pp. 171-198

Quadratic assignment problems (QAPs) are known to be among the most challenging discrete optimization problems. Recently, a new class of semi-definite relaxation models for QAPs based on matrix splitting has been proposed (Mittelmann and Peng, SIAM J Optim 20:3408–3426, <CitationRef CitationID="CR25">2010</CitationRef>; Peng et...</citationref>

Persistent link: https://www.econbiz.de/10011151824

VERY LARGE-SCALE NEIGHBORHOOD SEARCH FOR THE QUADRATIC ASSIGNMENT PROBLEM

Ahuja, Ravindra; Jha, Krishna; Orlin, James; Sharma, … - Sloan School of Management, Massachusetts Institute of … - 2003

The Quadratic Assignment Problem (QAP) consists of assigning n facilities to n locations so as to minimize the total …

Persistent link: https://www.econbiz.de/10005458613

A bilinear programming solution to the quadratic assignment problem

Kaashoek, J.F.; Paelinck, J.H.P. - Erasmus University Rotterdam, Econometric Institute - 1999

The quadratic assignment problem (QAP) or maximum acyclical graph problem is well documented (see e.g. Pardalos and …

Persistent link: https://www.econbiz.de/10008584772

A bilinear programming solution to the quadratic assignment problem

Kaashoek, Kaashoek, J.F.; Paelinck, Paelinck, J.H.P. - Faculteit der Economische Wetenschappen, Erasmus … - 1999

The quadratic assignment problem (QAP) or maximum acyclical graph problem is well documented (see e.g. Pardalos and …

Persistent link: https://www.econbiz.de/10010731566