The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure (Q1785334): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2014.12.009 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2169867839 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1407.2801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Algorithm for Seriation and the Consecutive Ones Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral algorithm for envelope reduction of sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to simple special cases of extremal permutation problems / 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: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-solvable cases of the QAP with block-structured matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Robinsonian dissimilarities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of circular decomposable metrics / 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: Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxations for Permutation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edgeconvex Circuits and the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices, interval graphs and seriation in archeology / 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: Seriation and matrix reordering methods: An historical overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the consecutive ones property / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm to recognize Robinsonian dissimilarities / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2014.12.009 / rank
 
Normal rank

Latest revision as of 11:16, 11 December 2024

scientific article
Language Label Description Also known as
English
The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
scientific article

    Statements

    The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure (English)
    0 references
    28 September 2018
    0 references
    quadratic assignment problem
    0 references
    seriation
    0 references
    Robinson (dis)similarity
    0 references
    well solvable special case
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references