Tree-search algorithms for quadratic assignment problems
From MaRDI portal
Publication:5620476
DOI10.1002/nav.3800180102zbMath0216.54404OpenAlexW2051536351MaRDI QIDQ5620476
Wallace B. Crowston, John F. Pierce
Publication date: 1971
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800180102
Related Items
The facility layout problem, A survey for the quadratic assignment problem, Quadratic assignment problems, Finding linear and circular sequences of minimal and maximal total adjacency, Contributions to the quadratic assignment problem, A heuristic procedure for solving the quadratic assignment problem, Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick, Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme, Models and methods of solution of quadratic integer programming problems, Exact algorithms for the solution of the grey pattern quadratic assignment problem, A distance assignment approach to the facility layout problem, A layout design heuristic employing the theory of fuzzy sets, An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization, Cotas inferiores para el QAP-Arbol, A contribution to quadratic assignment problems, A branch and bound method for solving the bidirectional circular layout problem, An algorithm for the quadratic assignment problem using Benders' decomposition, A neural network approach to facility layout problems, Exact Solution of Two Location Problems via Branch-and-Bound, An improved tabu search heuristic for solving facility layout design problems, An exact algorithm for the general quadratic assignment problem, An upper bound for the speedup of parallel best-bound branch-and-bound algorithms, Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
Cites Work
