Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming (Q2260052): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11336-002-1032-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026393124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correspondence analysis and optimal structural representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive multiobjective programming approach to combinatorial data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for maximum likelihood paired comparison ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch search algorithm for maximum likelihood paired comparison ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tunneling method for global optimization in multidimensional scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization in least-squares multidimensional scaling by distance smoothing / rank
 
Normal rank
Property / cites work
 
Property / cites work: SERIATION USING ASYMMETRIC PROXIMITY MEASURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and circular unidimensional scaling for symmetric proximity matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Data Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear unidimensional scaling in the \(L_2\)-norm: Basic optimization methods using MATLAB. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The comparison and fitting of given classification schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric unidimensional scaling and global optimization / rank
 
Normal rank

Latest revision as of 19:43, 9 July 2024

scientific article
Language Label Description Also known as
English
Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
scientific article

    Statements

    Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming (English)
    0 references
    0 references
    0 references
    5 March 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial data analysis
    0 references
    least-squares unidimensional scaling
    0 references
    branch-and-bound
    0 references
    dynamic programming
    0 references
    0 references
    0 references