A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
From MaRDI portal
Publication:1838910
DOI10.1016/0377-2217(83)90097-8zbMath0509.90058OpenAlexW2078152952MaRDI QIDQ1838910
Tilman Boenniger, Rainer E. Burkard
Publication date: 1983
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(83)90097-8
linearizationheuristic algorithmcomputational experiencequadratic assignment problemssuboptimal solutionstest resultsbottleneck objective functionsquadratic Boolean programs
Related Items
Lower bounds for the quadratic assignment problem, The facility layout problem, A genetic approach to the quadratic assignment problem, A new exact algorithm for the solution of quadratic assignment problems, A survey for the quadratic assignment problem, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, A branch-and-cut algorithm for quadratic assignment problems based on linearizations, An efficient continuation method for quadratic assignment problems, Quadratic assignment problems, A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm, The multi-story space assignment problem, A heuristic procedure for the single-row facility layout problem, Global optimality conditions and optimization methods for quadratic assignment problems, Single and multiple period layout models for automated manufacturing systems, Models and methods of solution of quadratic integer programming problems, An experimental study of variable depth search algorithms for the quadratic assignment problem, Problema de asignacion cuadratica multiobjetivo, Experimental analysis of crossover and mutation operators on the quadratic assignment problem, A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem, Simulated annealing heuristics for the dynamic facility layout problem, Loop based facility planning and material handling, A hybrid heuristic for the facilities layout problem, A convex form of the quadratic assignment problem, A neural network approach to facility layout problems, An improved annealing scheme for the QAP, Heuristic methods and applications: A categorized survey, A greedy genetic algorithm for the quadratic assignment problem, Hybrid ant systems for the dynamic facility layout problem, A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method, A new linearization method for quadratic assignment problems, A thermodynamically motivated simulation procedure for combinatorial optimization problems, Efficient models for the facility layout problem
Cites Work
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- An algorithm for the quadratic assignment problem using Benders' decomposition
- The Backboard Wiring Problem: A Placement Algorithm
- The asymptotic probabilistic behaviour of quadratic sum assignment problems
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Hospital Layout as a Quadratic Assignment Problem
- Numerical investigations on quadratic assignment problems
