Numerical investigations on quadratic assignment problems

DOI10.1002/nav.3800250111zbMath0391.90066OpenAlexW2113135226MaRDI QIDQ4173192

Karl-Heinz Stratmann, Rainer E. Burkard

Publication date: 1978

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800250111

zbMATH Keywords

Computational Efficiency Perturbation Method Branch and Bound Algorithm Bottleneck Problems Numerical Investigations Quadratic Assignment Problems Suboptimal Solutions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items

Flow distance reduction for a multi-product flowline with sets of identical machines ⋮ Strengthening Gilmore's bound for the quadratic assignment problem ⋮ Comment on ``The facility layout problem ⋮ Large-scale layout of facilities using a heuristic hybrid algorithm ⋮ Lower bounds for the quadratic assignment problem ⋮ The facility layout problem ⋮ PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID ⋮ A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem ⋮ A survey for the quadratic assignment problem ⋮ A branch-and-cut algorithm for quadratic assignment problems based on linearizations ⋮ A heuristic method for the multi-story layout problem ⋮ Optimization of the movements of a component placement machine ⋮ Quadratic assignment problems ⋮ Optimal sequences in stochastic single machine shops ⋮ A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm ⋮ Backtracking of jobs in one-dimensional machine location problems ⋮ Sequential algorithm for the solution of problems of combinatorial optimization on permutations ⋮ Special cases of the quadratic assignment problem ⋮ An algorithm for quadratic assignment problems ⋮ Two-level modified simulated annealing based approach for solving facility layout problem ⋮ Contributions to the quadratic assignment problem ⋮ Global optimality conditions and optimization methods for quadratic assignment problems ⋮ On the quadratic assignment problem ⋮ Single and multiple period layout models for automated manufacturing systems ⋮ A heuristic algorithm for the quadratic assignment formulation to the plant layout problem ⋮ Integrating facility layout with process selection and capacity planning ⋮ A distance assignment approach to the facility layout problem ⋮ RLT insights into lift-and-project closures ⋮ Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme ⋮ A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem ⋮ A new heuristic for the linear placement problem ⋮ A hybrid heuristic for the facilities layout problem ⋮ A parallel heuristic for quadratic assignment problems ⋮ An algorithm for the quadratic assignment problem using Benders' decomposition ⋮ A mathematical model and a heuristic procedure for the turbine balancing problem ⋮ Directional decomposition heuristic for a linear machine-cell location problem. ⋮ A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem ⋮ A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem ⋮ One-dimensional machine location problems in a multi-product flowline with equidistant locations ⋮ A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems ⋮ A heuristic for quadratic Boolean programs with applications to quadratic assignment problems ⋮ Move based heuristics for the unidirectional loop network layout problem ⋮ The asymptotic probabilistic behaviour of quadratic sum assignment problems ⋮ On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem ⋮ An exact algorithm for the general quadratic assignment problem ⋮ Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation ⋮ Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods

Cites Work