Publication Date
| In 2025 | 0 |
| Since 2024 | 0 |
| Since 2021 (last 5 years) | 0 |
| Since 2016 (last 10 years) | 0 |
| Since 2006 (last 20 years) | 1 |
Descriptor
| Computation | 1 |
| Data Analysis | 1 |
| Heuristics | 1 |
| Matrices | 1 |
| Programming | 1 |
Source
| Psychometrika | 1 |
Publication Type
| Journal Articles | 1 |
| Reports - Research | 1 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewed
Direct linkBrusco, Michael J.; Kohn, Hans-Friedrich; Stahl, Stephanie – Psychometrika, 2008
Dynamic programming methods for matrix permutation problems in combinatorial data analysis can produce globally-optimal solutions for matrices up to size 30x30, but are computationally infeasible for larger matrices because of enormous computer memory requirements. Branch-and-bound methods also guarantee globally-optimal solutions, but computation…
Descriptors: Heuristics, Programming, Data Analysis, Matrices
