A divide-and-conquer local search heuristic for data visualization (Q2499138): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2005.01.020 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Modern multidimensional scaling: theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visualizing group decisions in the analytic hierarchy process. / 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: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4441032 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2005.01.020 / rank
 
Normal rank

Latest revision as of 01:26, 19 December 2024

scientific article
Language Label Description Also known as
English
A divide-and-conquer local search heuristic for data visualization
scientific article

    Statements

    A divide-and-conquer local search heuristic for data visualization (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2006
    0 references
    data visualization
    0 references
    discrete optimization
    0 references
    local search
    0 references
    multidimensional scaling
    0 references
    quadratic assignment problem
    0 references

    Identifiers