Two classes of quadratic assignment problems that are solvable as linear assignment problems (Q665995): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Barbaros C. Tansel / rank
Normal rank
 
Property / author
 
Property / author: Barbaros C. Tansel / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QAPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964357023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: QAPLIB - a quadratic assignment problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special cases of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable case of the quadratic assignment problem / rank
 
Normal rank

Latest revision as of 00:01, 5 July 2024

scientific article
Language Label Description Also known as
English
Two classes of quadratic assignment problems that are solvable as linear assignment problems
scientific article

    Statements

    Two classes of quadratic assignment problems that are solvable as linear assignment problems (English)
    0 references
    0 references
    0 references
    7 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    quadratic assignment problem
    0 references
    linear assignment problem
    0 references
    computational complexity
    0 references
    polynomial time solvability
    0 references
    0 references