The Quadratic Assignment Problem
From MaRDI portal
Publication:2778995
DOI10.1287/mnsc.9.4.586zbMath0995.90579MaRDI QIDQ2778995
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
90B80: Discrete location and assignment
Related Items
A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem, Machine layout problem in modern manufacturing facilities, A genetic algorithm for facility layout, Reconfigurable layout problem, Locating cells with bottleneck machines in cellular manufacturing systems, Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability, The QAP-polytope and the star transformation, Quadratic assignment problems, Comparison of the performance of modern heuristics for combinatorial optimization on real data, Pseudo-Boolean optimization, Selected topics on assignment problems, Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing, Efficient models for the facility layout problem, A survey for the quadratic assignment problem, Assignment problems: a golden anniversary survey, A branch-and-cut algorithm for quadratic assignment problems based on linearizations, A level-2 reformulation-linearization technique bound for the quadratic assignment problem, Methods for the one-dimensional space allocation problem, Mapping the convergence of genetic algorithms, Unit integer quadratic binary programming, An exact algorithm for the general quadratic assignment problem, On lower bounds for a class of quadratic 0,1 programs, The facility layout problem, A heuristic method for the multi-story layout problem, The Boolean quadratic polytope: Some characteristics, facets and relatives, A parallel depth first search branch and bound algorithm for the quadratic assignment problem, Contributions to the quadratic assignment problem, A heuristic procedure for solving the quadratic assignment problem, On the quadratic assignment problem, Single and multiple period layout models for automated manufacturing systems, A location problem on unicyclic networks: Balanced case, Simulated annealing for machine layout problems in the presence of zoning constraints, Layout design for flexible manufacturing systems, A distance assignment approach to the facility layout problem, Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem, Generating quadratic assignment test problems with known optimal permutations, Algorithms for robust single and multiple period layout planning for manufacturing systems, An interactive layout heuristic based on hexagonal adjacency graphs, Integer programming formulation of combinatorial optimization problems, An algorithm for the quadratic assignment problem using Benders' decomposition, A solvable case of the quadratic assignment problem, Optimizing simulated annealing schedules with genetic programming, The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases, Network-based formulations of the quadratic assignment problem, Lower bounds for nonlinear assignment problems using many body interactions, A GRASP for the biquadratic assignment problem, Move based heuristics for the unidirectional loop network layout problem, A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method, A variant of time minimizing assignment problem, A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system, Strengthening Gilmore's bound for the quadratic assignment problem, Lower bounds for the quadratic assignment problem, A new exact algorithm for the solution of quadratic assignment problems, Solution methods for the balancing of jet turbines, A classification of formulations for the (time-dependent) traveling salesman problem, A heuristic procedure for the single-row facility layout problem, FACOPT: A user friendly FACility layout OPTimization system., A greedy genetic algorithm for the quadratic assignment problem, A novel chaotic search for quadratic assignment problems, Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation, Extended neighborhood: Definition and characterization, A performance guarantee heuristic for electronic components placement problems including thermal effects, Lower bounds based on linear programming for the quadratic assignment problem, A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem, A Lagrangian relaxation algorithm for sparse quadratic assignment problems, Lower bounds for the quadratic assignment problem via triangle decompositions, A hybrid heuristic for the facilities layout problem, A parallel heuristic for quadratic assignment problems, Genetic algorithm for linear and cyclic assignment problem, The quadratic three-dimensional assignment problem: exact and approximate solution methods, Constrained 0-1 quadratic programming: basic approaches and extensions, Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique, Exact procedures for solving the discrete ordered median problem, Single- and multi-objective facility layout with workflow interference considerations, An algorithm for indefinite integer quadratic programming, 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, Cotas inferiores para el QAP-Arbol, A contribution to quadratic assignment problems, Global minimization of large-scale constrained concave quadratic problems by separable programming, Multiple objective programming for the quadratic assignment problem, Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme, Toward a land use planning model for new towns†, An improved tabu search heuristic for solving facility layout design problems
