Room allocation: a polynomial subcase of the quadratic assignment problem

DOI10.1016/J.DAM.2004.01.004MaRDI QIDQ1765233zbMATH OpenOpenAlexFDO

Authors Valentina Ciriani, Nadia Pisanti, A. Bernasconi

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

Combinatorial algorithmQuadratic assignment problemAllocation

Mathematics Subject Classification ID

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

Recommendations

• A contribution to quadratic assignment problems
• scientific article; zbMATH DE number 1302195
• An exact algorithm for the general quadratic assignment problem
• Two classes of quadratic assignment problems that are solvable as linear assignment problems
• A note on a polynomial time solvable case of the quadratic assignment problem

Cites work

• scientific article; zbMATH DE number 714526 (Why is no real title available?)
• A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
• A polynomially solvable class of quadratic semi-assignment problems
• Optimal Linear Ordering
• Quadratic assignment problems on series-parallel digraphs
• Solving semidefinite quadratic problems within nonsmooth optimization algorithms

Cited in

(5)

• 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
• scientific article; zbMATH DE number 2148765 (Why is no real title available?)

This page was built for publication: Room allocation: a polynomial subcase of the quadratic assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765233)