Exact algorithms for the solution of the grey pattern quadratic assignment problem
From MaRDI portal
Publication:494699
DOI10.1007/s00186-015-0505-1zbMath1323.90032OpenAlexW2105043934MaRDI QIDQ494699
Gintaras Palubeckis, Alfonsas Misevičius, Zvi Drezner
Publication date: 2 September 2015
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-015-0505-1
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (5)
Taking advantage of symmetry in some quadratic assignment problems ⋮ 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 ⋮ Finding optimal solutions to several gray pattern instances
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enhancing the performance of hybrid genetic algorithms by differential improvement
- Competitive location in the plane
- Improving worst-case behavior of heaps
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- New approaches to circle packing in a square. With program codes.
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- The quadratic assignment problem. Theory and algorithms
- Pruning by isomorphism in branch-and-cut
- A new exact discrete linear reformulation of the quadratic assignment problem
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Finding a cluster of points and the grey pattern quadratic assignment problem
- Three Ideas for the Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- Covering continuous demand in the plane
- Solving quadratic assignment problems with rectangular distances and integer programming
- The p-center location problem in an area
- Comparison of iterative searches for the quadratic assignment problem
- Isomorph-Free Exhaustive Generation
- Tree-search algorithms for quadratic assignment problems
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Quicksort
This page was built for publication: Exact algorithms for the solution of the grey pattern quadratic assignment problem
