Finding optimal solutions to several gray pattern instances

DOI10.1007/s11590-021-01732-1zbMath1487.90512OpenAlexW3154823460MaRDI QIDQ2115324

Alfonsas Misevičius, Zvi Drezner, Gintaras Palubeckis, Pawel Jan Kalczynski

Publication date: 15 March 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01732-1

zbMATH Keywords

quadratic assignment problemoptimal algorithmsgray pattern

Mathematics Subject Classification ID

Quadratic programming (90C20) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (2)

An efficient heuristic for the \(k\)-partitioning problem ⋮ The repeated p-dispersion problem

Uses Software

• QAPLIB
• CPLEX
• Gurobi

Cites Work

• Exact algorithms for the solution of the grey pattern quadratic assignment problem
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
• A survey for the quadratic assignment problem
• The equitable dispersion problem
• QAPLIB - a quadratic assignment problem library
• A simple recipe for concise mixed 0-1 linearizations
• Measuring diversity. A review and an empirical analysis
• Iterated tabu search for the maximum diversity problem
• Finding a cluster of points and the grey pattern quadratic assignment problem
• A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
• Comparison of iterative searches for the quadratic assignment problem

This page was built for publication: Finding optimal solutions to several gray pattern instances