Room allocation: a polynomial subcase of the quadratic assignment problem

The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Very few instances of this problem can be solved in polynomial time. In this paper we address the problem of allocating rooms among people in a suitable shape of corridor with some constraints of undesir...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 144; no. 3; pp. 263 - 269
Main Authors Ciriani, Valentina, Pisanti, Nadia, Bernasconi, Anna
Format Journal Article Conference Proceeding
LanguageEnglish
Published Lausanne Elsevier B.V 15.12.2004
Amsterdam Elsevier
New York, NY
Subjects
Algorithmics. Computability. Computer arithmetics
Allocation
Applied sciences
Combinatorial algorithm
Computer science; control theory; systems
Exact sciences and technology
Mathematical programming
Operational research and scientific management
Operational research. Management science
Quadratic assignment problem
Theoretical computing
Allocation
Combinatorial algorithm
Quadratic assignment problem
Quadratic assignment
Computer theory
Combinatorial optimization
Polynomial time
Online AccessGet full text
ISSN0166-218X
1872-6771
DOI10.1016/j.dam.2004.01.004

Cover

More Information
Summary:The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Very few instances of this problem can be solved in polynomial time. In this paper we address the problem of allocating rooms among people in a suitable shape of corridor with some constraints of undesired neighborhood. We give a linear time algorithm for this problem that we formulate as a QAP.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2004.01.004