Exact algorithms for the solution of the grey pattern quadratic assignment problem-Reference-Cited by-同舟云学术

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

Published:2015-06-02 Issue:1 Volume:82 Page:85-105
ISSN:1432-2994
Container-title:Mathematical Methods of Operations Research
language:en
Short-container-title:Math Meth Oper Res

Author:

Drezner Zvi,Misevičius Alfonsas,Palubeckis Gintaras

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s00186-015-0505-1.pdf

Reference31 articles.

1. Burkard RE (1990) Locations with spatial interactions: the quadratic assignment problem. In: Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley-Interscience, New York, pp 387–437

2. Carlsson S (1984) Improving worst-case behavior of heaps. BIT Numer Math 24:14–18

3. Cela E (1998) The quadratic assignment problem: theory and algorithms. Kluwer, Dordrecht

4. Coxeter HSM (1973) Regular polytopes. Dover Publications, New York

5. Drezner Z (2006) Finding a cluster of points and the grey pattern quadratic assignment problem. OR Spectr 28:417–436

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Different formulations of the gray pattern problem and their optimal solutions;European Journal of Operational Research;2024-07

2. An Efficient Heuristic for the k-Partitioning Problem;Operations Research Forum;2023-09-28

3. The repeated p-dispersion problem;INFOR: Information Systems and Operational Research;2023-02-01

4. Less Is More Approach in Heuristic Optimization;The Palgrave Handbook of Operations Research;2022

5. Finding optimal solutions to several gray pattern instances;Optimization Letters;2021-04-13