Tree-search algorithms for quadratic assignment problems
From MaRDI portal
Cites work
Cited in
(23)- An algorithm for the quadratic assignment problem using Benders' decomposition
- Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
- Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
- Exact solution of two location problems via branch-and-bound
- A branch and bound method for solving the bidirectional circular layout problem
- A survey for the quadratic assignment problem
- A neural network approach to facility layout problems
- An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization
- An improved tabu search heuristic for solving facility layout design problems
- Finding linear and circular sequences of minimal and maximal total adjacency
- A layout design heuristic employing the theory of fuzzy sets
- Cotas inferiores para el QAP-Arbol
- The facility layout problem
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
- Models and methods of solution of quadratic integer programming problems
- Exact algorithms for the solution of the grey pattern quadratic assignment problem
- A contribution to quadratic assignment problems
- A distance assignment approach to the facility layout problem
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- Contributions to the quadratic assignment problem
- A heuristic procedure for solving the quadratic assignment problem
- Quadratic assignment problems
- An exact algorithm for the general quadratic assignment problem
This page was built for publication: Tree-search algorithms for quadratic assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5620476)
