Exact algorithms for the solution of the grey pattern quadratic assignment problem

DOI10.1007/S00186-015-0505-1MaRDI QIDQ494699zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

branch and boundquadratic assignmentgrey pattern

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

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

Cites work

• scientific article; zbMATH DE number 1803767 (Why is no real title available?)
• scientific article; zbMATH DE number 4199950 (Why is no real title available?)
• scientific article; zbMATH DE number 3074559 (Why is no real title available?)
• A new exact discrete linear reformulation of the quadratic assignment problem
• Assignment Problems and the Location of Economic Activities
• Comparison of iterative searches for the quadratic assignment problem
• Competitive location in the plane
• Covering continuous demand in the plane
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Enhancing the performance of hybrid genetic algorithms by differential improvement
• 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
• Improving worst-case behavior of heaps
• Isomorph-Free Exhaustive Generation
• New approaches to circle packing in a square. With program codes.
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Pruning by isomorphism in branch-and-cut
• Quicksort
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
• Solving quadratic assignment problems with rectangular distances and integer programming
• The p-center location problem in an area
• The quadratic assignment problem. Theory and algorithms
• Three Ideas for the Quadratic Assignment Problem
• Tree-search algorithms for quadratic assignment problems

Cited in

(7)

• Finding optimal solutions to several gray pattern instances
• Finding a cluster of points and the grey pattern quadratic assignment problem
• Taking advantage of symmetry in some quadratic assignment problems
• The repeated p-dispersion problem
• Different formulations of the gray pattern problem and their optimal solutions
• Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming
• An efficient heuristic for the \(k\)-partitioning problem

Describes a project that uses

Uses Software

• Quicksort

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)