Search Results - subject:"Quadratic assignment"

A new exact discrete linear reformulation of the quadratic assignment problem

Nyberg, Axel; Westerlund, Tapio - In: European Journal of Operational Research 220 (2012) 2, pp. 314-319

The quadratic assignment problem (QAP) is a challenging combinatorial problem. The problem is NP-hard and in addition … instances (with the size n=32 and 64), from the quadratic assignment problem library, QAPLIB. …

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

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

On the unboundedness of facility layout problems

Drezner, Zvi - In: Computational Statistics 72 (2010) 2, pp. 205-216

Facility layout problems involve the location of facilities in a planar arrangement such that facilities that are strongly connected to one another are close to each other and facilities that are not connected may be far from one another. Pairs of facilities that have a negative connection...

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

On the unboundedness of facility layout problems

Drezner, Zvi - In: Mathematical Methods of Operations Research 72 (2010) 2, pp. 205-216

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

COAP 2008 best paper award: Paper of P.M. Hahn, B.-J. Kim, M. Guignard, J.M. Smith and Y.-R. Zhu

Hager, W. - In: Computational Optimization and Applications 44 (2009) 3, pp. 525-530

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

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

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

Order-Constrained Solutions in K-Means Clustering: Even Better Than Being Globally Optimal

Steinley, Douglas; Hubert, Lawrence - In: Psychometrika 73 (2008) 4, pp. 647-664

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

IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM

TATSUMI, KEIJI; TANINO, TETSUZO - In: International Journal of Information Technology & … 07 (2008) 01, pp. 53-70

two models and propose a new CHN with an efficient projection technique for the quadratic assignment problem, which …

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

Modeling and Analysis of Congestion in the Design of Facility Layouts

Benjaafar, Saifallah - In: Management Science 48 (2002) 5, pp. 679-704

obtained using the conventional quadratic assignment problem (QAP) formulation. For example, we show that a QAP-optimal layout …

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