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

DOI10.1007/S00291-005-0010-7MaRDI QIDQ2507561zbMATH OpenOpenAlexFDO

Authors 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

clustergrey patternmetaheuristicsquadratic assignment problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Exact algorithms for the solution of the grey pattern quadratic assignment problem
• The repeated p-dispersion problem
• Clustering to minimize the maximum intercluster distance
• Finding optimal solutions to several gray pattern instances
• The discrete p-dispersion problem

Cites work

• A tabu search algorithm for the quadratic assignment problem
• Assignment Problems and the Location of Economic Activities
• Comparison of iterative searches for the quadratic assignment problem
• Future paths for integer programming and links to artificial intelligence
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Heuristic procedures for the m-partial cover problem on a plane
• scientific article; zbMATH DE number 1803756 (Why is no real title available?)
• scientific article; zbMATH DE number 1803767 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 2013511 (Why is no real title available?)
• scientific article; zbMATH DE number 2096819 (Why is no real title available?)
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• Note—On a Modified One-Center Model
• Optimization by simulated annealing
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
• The multiple server location problem

Cited in

(9)

• A new exact discrete linear reformulation of the quadratic assignment problem
• Finding optimal solutions to several gray pattern instances
• 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
• An efficient heuristic for the \(k\)-partitioning problem
• Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming
• The repeated p-dispersion problem
• Different formulations of the gray pattern problem and their optimal solutions

Describes a project that uses

Uses Software

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

This page was built for publication: Finding a cluster of points and the grey pattern quadratic assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2507561)