Quadratic assignment problems

DOI10.1016/0377-2217(84)90093-6zbMath0526.90064OpenAlexW2020570543MaRDI QIDQ594767

Rainer E. Burkard

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90093-6

zbMATH Keywords

surveycomplexityfacility locationasymptotic probabilistic behaviourexact and heuristic solution methodsquadratic assignment problemsrandomly generated problemstypewriter keyboard design

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Inventory, storage, reservoirs (90B05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching, The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach, Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems, Strengthening Gilmore's bound for the quadratic assignment problem, Comment on ``The facility layout problem, A user's guide to tabu search, The move-to-partner rule for self-organizing task allocation on a linear array, A study of diversification strategies for the quadratic assignment problem, A survey for the quadratic assignment problem, Assignment problems: a golden anniversary survey, Quadratic assignment problems on series-parallel digraphs, A Lagrangian relaxation algorithm for sparse quadratic assignment problems, Survey of quantitative methods in construction, Tabu search and iterated local search for the cyclic bottleneck assignment problem, Optimization of the movements of a component placement machine, Optimal sequences in stochastic single machine shops, Bayesian object matching, An exact completely positive programming formulation for the discrete ordered median problem: an extended version, Using artificial bees to solve partitioning and scheduling problems in codesign, Applications of Quadratic Programming, A collaborative neurodynamic approach to global and combinatorial optimization, A heuristic procedure for the single-row facility layout problem, Kernel technology to solve discrete optimization problems, Solving the quadratic assignment problem, Solving the quadratic assignment problem by the repeated iterated tabu search method, Random assignment problems, Experimental analysis of simulated annealing based algorithms for the layout problem, A distance assignment approach to the facility layout problem, Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem, A connectionist approach to the quadratic assignment problem, Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation, A mathematical model for zoning of protected natural areas, A hybrid heuristic for the facilities layout problem, A contribution to quadratic assignment problems, A mathematical model and a heuristic procedure for the turbine balancing problem, A convex form of the quadratic assignment problem, An improved annealing scheme for the QAP, Optimizing simulated annealing schedules with genetic programming, A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem, Heuristic methods and applications: A categorized survey, A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method, A thermodynamically motivated simulation procedure for combinatorial optimization problems, Ranking scalar products to improve bounds for the quadratic assignment problem, Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism, Efficient operation of a surface mounting machine with a multihead turret, An improved tabu search heuristic for solving facility layout design problems, Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming, Efficient models for the facility layout problem, A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system, On lower bounds for a class of quadratic 0,1 programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• On the quadratic assignment problem
• An algorithm for the quadratic assignment problem using Benders' decomposition
• A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
• The Quadratic Assignment Problem
• Duality and admissible transformations in combinatorial optimization
• The Backboard Wiring Problem: A Placement Algorithm
• Assignment Problems and the Location of Economic Activities
• The asymptotic probabilistic behaviour of quadratic sum assignment problems
• Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
• On random quadratic bottleneck assignment problems
• A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
• P-Complete Approximation Problems
• Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
• Hospital Layout as a Quadratic Assignment Problem
• Numerical investigations on quadratic assignment problems
• An exact branch-and-bound procedure for the quadratic-assignment problem
• An Algorithm for the Quadratic Assignment Problem
• Tree-search algorithms for quadratic assignment problems
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem