Exact algorithms for the solution of the grey pattern quadratic assignment problem
DOI10.1007/S00186-015-0505-1zbMATH Open1323.90032OpenAlexW2105043934MaRDI QIDQ494699FDOQ494699
Authors: Alfonsas Misevičius, Gintaras Palubeckis, 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
Recommendations
- A new exact algorithm for the solution of quadratic assignment problems
- An exact algorithm for the general quadratic assignment problem
- Finding a cluster of points and the grey pattern quadratic assignment problem
- Recent advances in the solution of quadratic assignment problems
- scientific article; zbMATH DE number 4143776
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Cites Work
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- The quadratic assignment problem. Theory and algorithms
- Assignment Problems and the Location of Economic Activities
- The p-center location problem in an area
- Title not available (Why is that?)
- Comparison of iterative searches for the quadratic assignment problem
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- New approaches to circle packing in a square. With program codes.
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Enhancing the performance of hybrid genetic algorithms by differential improvement
- Covering continuous demand in the plane
- Isomorph-Free Exhaustive Generation
- Improving worst-case behavior of heaps
- Three Ideas for the Quadratic Assignment Problem
- Pruning by isomorphism in branch-and-cut
- Finding a cluster of points and the grey pattern quadratic assignment problem
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- A new exact discrete linear reformulation of the quadratic assignment problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving quadratic assignment problems with rectangular distances and integer programming
- Tree-search algorithms for quadratic assignment problems
- Quicksort
- Competitive location in the plane
Cited In (7)
- The repeated p-dispersion problem
- Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming
- Finding optimal solutions to several gray pattern instances
- Different formulations of the gray pattern problem and their optimal solutions
- An efficient heuristic for the \(k\)-partitioning problem
- Taking advantage of symmetry in some quadratic assignment problems
- Finding a cluster of points and the grey pattern quadratic assignment problem
Uses Software
This page was built for publication: Exact algorithms for the solution of 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 Q494699)
