Skip to main content
Log in

Integer Programming Methods for Seriation and Unidemensional Scaling of Proximity Matrices: A Review and Some Extensions

  • Published:
Journal of Classification Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00357-001-0032-z

Keywords

Navigation