The Quadratic Assignment Problem

DOI10.1287/MNSC.9.4.586zbMath0995.90579OpenAlexW2084512390MaRDI QIDQ2778995

Eugene L. Lawler

Publication date: 22 October 2002

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.9.4.586

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (only showing first 100 items - show all)

Genetic algorithm for linear and cyclic assignment problem ⋮ Convex Relaxations for Permutation Problems ⋮ PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID ⋮ The quadratic three-dimensional assignment problem: exact and approximate solution methods ⋮ An algorithm for indefinite integer quadratic programming ⋮ Global minimization of large-scale constrained concave quadratic problems by separable programming ⋮ A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives ⋮ Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence ⋮ The Rank-One Quadratic Assignment Problem ⋮ A fast projected fixed-point algorithm for large graph matching ⋮ Integrating combinatorial algorithms into a linear programming solver ⋮ Gilmore-Lawler bound of quadratic assignment problem ⋮ An efficient heuristic for the \(k\)-partitioning problem ⋮ Multiple objective programming for the quadratic assignment problem ⋮ Store-wide space planning balancing Impulse and convenience ⋮ A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic ⋮ Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple ⋮ Sinkhorn Algorithm for Lifted Assignment Problems ⋮ The fractal geometry of fitness landscapes at the local optima level ⋮ The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows ⋮ A quadratic simplex algorithm for primal optimization over zero-one polytopes ⋮ Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme ⋮ Quadratic Combinatorial Optimization Using Separable Underestimators ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters ⋮ Toward a land use planning model for new towns† ⋮ Exact solution of emerging quadratic assignment problems ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem ⋮ Constrained 0-1 quadratic programming: basic approaches and extensions ⋮ Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique ⋮ Maximizing Polynomials Subject to Assignment Constraints ⋮ A layout design heuristic employing the theory of fuzzy sets ⋮ FALSA-facilities allocation by statistical analysis Part I. Further investigations on the cost distribution associated with the problem of facilities design ⋮ On the maximum edge-pair embedding bipartite matching ⋮ A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem ⋮ Machine layout problem in modern manufacturing facilities ⋮ Reconfigurable layout problem ⋮ A genetic algorithm for facility layout ⋮ The QAP-polytope and the star transformation ⋮ Locating cells with bottleneck machines in cellular manufacturing systems ⋮ Exact procedures for solving the discrete ordered median problem ⋮ Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability ⋮ A hybrid heuristic for the facilities layout problem ⋮ A parallel heuristic for quadratic assignment problems ⋮ Single- and multi-objective facility layout with workflow interference considerations ⋮ Cotas inferiores para el QAP-Arbol ⋮ A contribution to quadratic assignment problems ⋮ SDP Relaxations for Some Combinatorial Optimization Problems ⋮ Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting ⋮ A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices ⋮ GRASP with Path-Relinking for Facility Layout ⋮ A priority based unbalanced time minimization assignment problem ⋮ $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices ⋮ A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases ⋮ Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems ⋮ Exact Solution of Two Location Problems via Branch-and-Bound ⋮ Optimal Mass Transport for Activities Location Problem ⋮ Linear programming insights into solvable cases of the quadratic assignment problem ⋮ A revised reformulation-linearization technique for the quadratic assignment problem ⋮ An improved tabu search heuristic for solving facility layout design problems ⋮ Strengthening Gilmore's bound for the quadratic assignment problem ⋮ Lower bounds for the quadratic assignment problem ⋮ The facility layout problem ⋮ A new exact algorithm for the solution of quadratic assignment problems ⋮ A new class of hard problem instances for the 0-1 knapsack problem ⋮ Disentangling relationships in symptom networks using matrix permutation methods ⋮ Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem ⋮ The bipartite quadratic assignment problem and extensions ⋮ Lower bounding procedures for the single allocation hub location problem ⋮ A survey for the quadratic assignment problem ⋮ Assignment problems: a golden anniversary survey ⋮ Statistical shape analysis of brain arterial networks (BAN) ⋮ A branch-and-cut algorithm for quadratic assignment problems based on linearizations ⋮ A Lagrangian relaxation algorithm for sparse quadratic assignment problems ⋮ A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation ⋮ A heuristic method for the multi-story layout problem ⋮ Tabu search and iterated local search for the cyclic bottleneck assignment problem ⋮ Lower bounds and exact algorithms for the quadratic minimum spanning tree problem ⋮ Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation ⋮ A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems ⋮ Lower bounds for the quadratic assignment problem via triangle decompositions ⋮ Quadratic assignment problems ⋮ Solution methods for the balancing of jet turbines ⋮ A level-2 reformulation-linearization technique bound for the quadratic assignment problem ⋮ Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers ⋮ The Boolean quadratic polytope: Some characteristics, facets and relatives ⋮ The quadratic cycle cover problem: special cases and efficient bounds ⋮ A parallel depth first search branch and bound algorithm for the quadratic assignment problem ⋮ A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics ⋮ A classification of formulations for the (time-dependent) traveling salesman problem ⋮ A heuristic procedure for the single-row facility layout problem ⋮ Locating names on vertices of a transaction network ⋮ Contributions to the quadratic assignment problem ⋮ A new greedy algorithm for the quadratic assignment problem ⋮ A branch-and-bound algorithm for the single-row equidistant facility layout problem ⋮ Two-stage quadratic integer programs with stochastic right-hand sides ⋮ A heuristic procedure for solving the quadratic assignment problem ⋮ Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes ⋮ Methods for the one-dimensional space allocation problem ⋮ FACOPT: A user friendly FACility layout OPTimization system.

This page was built for publication: The Quadratic Assignment Problem