Exact algorithms for the solution of the grey pattern quadratic assignment problem

Zvi Drezner (), Alfonsas Misevičius () and Gintaras Palubeckis ()

Mathematical Methods of Operations Research, 2015, vol. 82, issue 1, 85-105

Abstract: We propose an exact algorithm to find the optimal solution to the grey pattern problem which is a special instance of the quadratic assignment problem. A very effective branch and bound algorithm is constructed. The special structure of the problem is exploited and optimal solutions for many problem instances established. One instance based on 64 facilities, organized in an 8 by 8 pattern, that was extensively researched in the literature was optimally solved in 15 s of computer time while existing papers report solution times of hours. Copyright Springer-Verlag Berlin Heidelberg 2015

Keywords: Quadratic assignment; Grey pattern; Branch and bound (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00186-015-0505-1 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:82:y:2015:i:1:p:85-105

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s00186-015-0505-1

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().