Room allocation: a polynomial subcase of the quadratic assignment problem

DOI10.1016/j.dam.2004.01.004zbMath1066.90060OpenAlexW2094003563MaRDI QIDQ1765233

Nadia Pisanti, Anna Bernasconi, Valentina Ciriani

Publication date: 23 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.01.004

zbMATH Keywords

Quadratic assignment problemCombinatorial algorithmAllocation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

A cooperative parallel tabu search algorithm for the quadratic assignment problem, A survey for the quadratic assignment problem, A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems, An experimental study of variable depth search algorithms for the quadratic assignment problem

Cites Work

• Unnamed Item
• A polynomially solvable class of quadratic semi-assignment problems
• Solving semidefinite quadratic problems within nonsmooth optimization algorithms
• Quadratic assignment problems on series-parallel digraphs
• A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
• Optimal Linear Ordering