Finding a cluster of points and the grey pattern quadratic assignment problem

DOI10.1007/s00291-005-0010-7zbMath1130.90027MaRDI QIDQ2507561

Zvi Drezner

Publication date: 4 October 2006

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-005-0010-7

zbMATH Keywords

cluster; metaheuristics; quadratic assignment problem; grey pattern

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B80: Discrete location and assignment

Related Items

A branch-and-bound algorithm for the single-row equidistant facility layout problem, Exact algorithms for the solution of the grey pattern quadratic assignment problem, Sequential location of two facilities: comparing random to optimal location of the first facility, A new exact discrete linear reformulation of the quadratic assignment problem, Finding optimal solutions to several gray pattern instances

Uses Software

• OR-Library
• SITATION
• MOD-DIST
• MENU-OKF
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
• Heuristic procedures for the m-partial cover problem on a plane
• A tabu search algorithm for the quadratic assignment problem
• Future paths for integer programming and links to artificial intelligence
• Assignment Problems and the Location of Economic Activities
• Note—On a Modified One-Center Model
• Comparison of iterative searches for the quadratic assignment problem
• The multiple server location problem
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph