Room allocation: a polynomial subcase of the quadratic assignment problem (Q1765233): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2004.01.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094003563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite quadratic problems within nonsmooth optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomially solvable class of quadratic semi-assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic assignment problems on series-parallel digraphs / rank
 
Normal rank

Latest revision as of 18:47, 7 June 2024

scientific article
Language Label Description Also known as
English
Room allocation: a polynomial subcase of the quadratic assignment problem
scientific article

    Statements

    Room allocation: a polynomial subcase of the quadratic assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2005
    0 references
    0 references
    Quadratic assignment problem
    0 references
    Allocation
    0 references
    Combinatorial algorithm
    0 references
    0 references