A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
From MaRDI portal
Cites work
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- 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
- The Backboard Wiring Problem: A Placement Algorithm
- The asymptotic probabilistic behaviour of quadratic sum assignment problems
Cited in
(32)- A new exact algorithm for the solution of quadratic assignment problems
- Hybrid ant systems for the dynamic facility layout problem
- A greedy genetic algorithm for the quadratic assignment problem
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- An efficient continuation method for quadratic assignment problems
- Global optimality conditions and optimization methods for quadratic assignment problems
- Heuristic methods and applications: A categorized survey
- A survey for the quadratic assignment problem
- A neural network approach to facility layout problems
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- The multi-story space assignment problem
- A new linearization method for quadratic assignment problems
- A hybrid heuristic for the facilities layout problem
- A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
- Loop based facility planning and material handling
- Efficient models for the facility layout problem
- The facility layout problem
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Single and multiple period layout models for automated manufacturing systems
- Models and methods of solution of quadratic integer programming problems
- An improved annealing scheme for the QAP
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- A convex form of the quadratic assignment problem
- Simulated annealing heuristics for the dynamic facility layout problem
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- Problema de asignacion cuadratica multiobjetivo
- A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem
- A genetic approach to the quadratic assignment problem
- A heuristic procedure for the single-row facility layout problem
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- Quadratic assignment problems
- Lower bounds for the quadratic assignment problem
This page was built for publication: A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838910)
