A note on a polynomial time solvable case of the quadratic assignment problem (Q865755): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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: W2171280220 / 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: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable case of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: QAPLIB - a quadratic assignment problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for quadratic assignment problems based on linearizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank

Latest revision as of 15:05, 25 June 2024

scientific article
Language Label Description Also known as
English
A note on a polynomial time solvable case of the quadratic assignment problem
scientific article

    Statements