Three Ideas for the Quadratic Assignment Problem
From MaRDI portal
Publication:3144407
DOI10.1287/opre.1120.1073zbMath1260.90117OpenAlexW2136423509MaRDI QIDQ3144407
Matteo Fischetti, Domenico Salvagnin, Michele Monaci
Publication date: 7 December 2012
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1120.1073
Related Items
Taking advantage of symmetry in some quadratic assignment problems, A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives, A geometric branch-and-bound algorithm for the service bundle design problem, Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers, A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique, Revisiting simulated annealing: a component-based analysis, Stabilizer-based symmetry breaking constraints for mathematical programs, Exact algorithms for the solution of the grey pattern quadratic assignment problem, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, On solving a hard quadratic 3-dimensional assignment problem, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
Uses Software
