Hospital Layout as a Quadratic Assignment Problem
From MaRDI portal
Cited in
(48)- A new exact algorithm for the solution of quadratic assignment problems
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- Adaptive layout for operating theatre in hospitals: different mathematical models for optimal layouts
- Assignment problems: a golden anniversary survey
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
- Decorous combinatorial lower bounds for row layout problems
- Heuristic methods and applications: A categorized survey
- Linear programming insights into solvable cases of the quadratic assignment problem
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Improving hospital layout planning through clinical pathway mining
- A survey for the quadratic assignment problem
- Large-scale layout of facilities using a heuristic hybrid algorithm
- An integrated method to solve the healthcare facility layout problem under area constraints
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
- Analysis of heuristics for finding a maximum weight planar subgraph
- A novel chaotic search for quadratic assignment problems
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
- Improved exact approaches for row layout problems with departments of equal length
- A modification of threshold accepting and its application to the quadratic assignment problem
- Parallel genetic algorithms with local search
- A hybrid heuristic for the facilities layout problem
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- A parallel ordering problem in facilities layout
- The facility layout problem
- Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems
- Optimal sequences in stochastic single machine shops
- SDP relaxations for some combinatorial optimization problems
- An improved annealing scheme for the QAP
- QAPLIB-A quadratic assignment problem library
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
- Locational analysis
- Problema de asignacion cuadratica multiobjetivo
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- Iterated local search for the quadratic assignment problem
- The random quadratic assignment problem
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- Convergence of the surrogate Lagrangian relaxation method
- A heuristic procedure for solving the quadratic assignment problem
- Graph similarity and approximate isomorphism
- Quadratic assignment problems
- A multi-parent genetic algorithm for the quadratic assignment problem
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- Solving the quadratic assignment problem by the repeated iterated tabu search method
This page was built for publication: Hospital Layout as a Quadratic Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124643)
