Pages that link to "Item:Q5620476"
From MaRDI portal
The following pages link to Tree-search algorithms for quadratic assignment problems (Q5620476):
Displaying 23 items.
- Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
- Quadratic assignment problems (Q594767) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- An exact algorithm for the general quadratic assignment problem (Q1067975) (← links)
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (Q1072940) (← links)
- The facility layout problem (Q1088577) (← links)
- Finding linear and circular sequences of minimal and maximal total adjacency (Q1137873) (← links)
- Contributions to the quadratic assignment problem (Q1142700) (← links)
- A heuristic procedure for solving the quadratic assignment problem (Q1158105) (← links)
- A distance assignment approach to the facility layout problem (Q1197697) (← links)
- An algorithm for the quadratic assignment problem using Benders' decomposition (Q1247369) (← links)
- A neural network approach to facility layout problems (Q1266731) (← links)
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation (Q1609910) (← links)
- A layout design heuristic employing the theory of fuzzy sets (Q3028685) (← links)
- Cotas inferiores para el QAP-Arbol (Q3354500) (← links)
- A contribution to quadratic assignment problems (Q3362092) (← links)
- Models and methods of solution of quadratic integer programming problems (Q3807880) (← links)
- Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick (Q4070966) (← links)
- Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme (Q4071009) (← links)
- An improved tabu search heuristic for solving facility layout design problems (Q4230253) (← links)
- An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization (Q5438610) (← links)
- Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
- A branch and bound method for solving the bidirectional circular layout problem (Q5961820) (← links)