L
1-norm are also presented. I conclude that the computational scaling problems depends largely on the criterion of interest, with unidimensional scaling problems depends largely on the criterion of interest, with unidimensional scaling in the L 1-norm being especially challenging.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Brusco, M. Integer Programming Methods for Seriation and Unidemensional Scaling of Proximity Matrices: A Review and Some Extensions. J. of Classification 19, 45–67 (2002). https://doi.org/10.1007/s00357-001-0032-z
Issue Date:
DOI: https://doi.org/10.1007/s00357-001-0032-z