Finding a cluster of points and the grey pattern quadratic assignment problem
From MaRDI portal
Publication:2507561
DOI10.1007/s00291-005-0010-7zbMath1130.90027OpenAlexW2127979074MaRDI QIDQ2507561
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
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (7)
A new exact discrete linear reformulation of the quadratic assignment problem ⋮ An efficient heuristic for the \(k\)-partitioning problem ⋮ Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming ⋮ 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 ⋮ Finding optimal solutions to several gray pattern instances
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Finding a cluster of points and the grey pattern quadratic assignment problem
