메뉴 건너뛰기




Volumn 33, Issue 11, 2006, Pages 3070-3087

A divide-and-conquer local search heuristic for data visualization

Author keywords

Data visualization; Discrete optimization; Local search; Multidimensional scaling; Quadratic assignment problem

Indexed keywords

ALGORITHMS; DATA ACQUISITION; MATHEMATICAL MODELS; NONLINEAR EQUATIONS; OPTIMIZATION; PROBLEM SOLVING;

EID: 33644677332     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.01.020     Document Type: Article
Times cited : (14)

References (13)
  • 4
    • 84887006810 scopus 로고
    • A nonlinear mapping for data structure analysis
    • J.W. Sammon A nonlinear mapping for data structure analysis IEEE Transactions on Computers 18 1969 401 409
    • (1969) IEEE Transactions on Computers , vol.18 , pp. 401-409
    • Sammon, J.W.1
  • 5
    • 0003598910 scopus 로고    scopus 로고
    • Deboeck G, Kohonen T, editors London: Springer
    • Deboeck G, Kohonen T, editors. Visual explorations in finance. London: Springer; 1998.
    • (1998) Visual Explorations in Finance
  • 8
    • 0037954502 scopus 로고    scopus 로고
    • Visualizing group decisions in the analytic hierarchy process
    • E. Condon, B. Golden, and E. Wasil Visualizing group decisions in the analytic hierarchy process Computers & Operations Research 30 2003 1435 1445
    • (2003) Computers & Operations Research , vol.30 , pp. 1435-1445
    • Condon, E.1    Golden, B.2    Wasil, E.3
  • 11
    • 0003408279 scopus 로고    scopus 로고
    • Local search in combinatorial optimization
    • Aarts E, Lenstra JK, editors West Sussex, England: Wiley
    • Aarts E, Lenstra JK, editors. Local search in combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization, West Sussex, England: Wiley; 1997.
    • (1997) Wiley-interscience Series in Discrete Mathematics and Optimization


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.