Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming (Q2260052)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming |
scientific article; zbMATH DE number 6411679
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming |
scientific article; zbMATH DE number 6411679 |
Statements
Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming (English)
0 references
5 March 2015
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
0 references
0 references
0 references
0.8649048805236816
0 references
0.7916339039802551
0 references
0.7906611561775208
0 references
0.7862750887870789
0 references
0.7764973640441895
0 references
