\begin{thebibliography}{99}

\bibitem{} Arabie, P. (1991). Was Euclid an unnecessarily sophisticated psychologist? \emph{Psychometrika}, \emph{56}, 567--587.   \index{A}{Arabie, P.}

\bibitem{} Arabie, P., Carroll, J. D., \& DeSarbo, W. S. (1987).  \emph{Three-way scaling and clustering}.  Newbury Park, CA: Sage. (Translated into Japanese by A. Okada \& T. Imaizumi, 1990. Tokyo: Kyoritsu Shuppan.)
 \index{A}{Arabie, P.}
 \index{A}{Carroll, J. D.}
 \index{A}{DeSarbo, W. S.}
 \index{A}{Okada, A.}
  \index{A}{Imaizumi, T.}



\bibitem{} Barth\'{e}lemy, J.-P., \& Gu\'{e}noche, A. (1991). \emph{Trees and proximity representations}. Chichester: Wiley.

 \index{A}{Barth\'{e}lemy, J.-P.}
 \index{A}{Gu\'{e}noche, A.}


\bibitem{} Bodewig, E. (1956). \emph{Matrix calculus}. Amsterdam: North-Holland.
 \index{A}{Bodewig, E.}

\bibitem{} Brossier, G. (1987). \'{E}tude des matrices de proximit\'{e} rectangulaires en vue de la classification [A study of rectangular proximity matrices from the point of view of classification]. \emph{Revue de Statistiques Appliqu\'{e}es}, \emph{35(4)}, 43--68.

 \index{A}{Brossier, G.}

\bibitem{} Brusco, M. J. (2001).  A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices.  \emph{Journal of Classification}, \emph{18}, 3--33.
 \index{A}{Brusco, M. J.}

\bibitem{} Brusco, M. J., \& Stahl, S. (2005).  Optimal least-squares unidimensional scaling: Improved branch-and-bound procedures and comparison to dynamic programming. \emph{Psychometrika}, \emph{70}, 253--270.
 \index{A}{Brusco, M. J.}
 \index{A}{Stahl, S.}


\bibitem{} Busing, F. M. T. A., Commandeur, J. J. F., \& Heiser, W. J. (1997).  PROXSCAL: A multidimensional scaling program for individual differences scaling with constraints.  In W. Bandilla \& F. Faulbaum (Eds.), \emph{Softstat '97: Advances in Statistical Software, Volume 6} (pp.\ 67--74).  Stuttgart: Lucius \& Lucius.

 \index{A}{Busing, F. M. T. A.}
 \index{A}{Commandeur, J. J. F.}
 \index{A}{Heiser, W. J.}
 \index{A}{Bandilla, W.}
 \index{A}{Faulbaum, F.}

\bibitem{} Carroll, J. D. (1976). Spatial, non-spatial and hybrid models for scaling.  \emph{Psychometrika}, \emph{41}, 439--463.
 \index{A}{Carroll, J. D.}

\bibitem{} Carroll, J. D. (1992).  Metric, nonmetric, and quasi-nonmetric analysis of psychological data.  Division 5 Presidential Address, American Psychological Association, Washington, DC, August, 1992 (published in \emph{Score}, Newsletter of Division 5, October, 1992, pp. 4--5).
 \index{A}{Carroll, J. D.}


\bibitem{} Carroll, J. D., \& Arabie, P. (1998). Multidimensional scaling.  In M. H. Birnbaum (Ed.), \emph{Handbook of perception and cognition, Vol. 3} (pp.\ 179--250). San Diego: Academic Press.
 \index{A}{Carroll, J. D.}
 \index{A}{Arabie, P.}
 \index{A}{Birnbaum, M. H.}


\bibitem{} Carroll, J. D., \& Chang, J. J. (1970). Analysis of individual differences in multidimensional scaling via an N-way generalization of ``Eckhart-Young'' decomposition.  \emph{Psychometrika}, \emph{35}, 283--319.
 \index{A}{Carroll, J. D.}
 \index{A}{Chang, J. J.}

\bibitem{} Carroll, J. D., Clark, L. A., \& DeSarbo, W. S. (1984).  The representation of three-way proximity data by single and multiple tree structure models.  \emph{Journal of Classification}, \emph{1}, 25--75.
 \index{A}{Carroll, J. D.}
 \index{A}{Clark, L. A.}
 \index{A}{DeSarbo, W. S.}


\bibitem{} Carroll, J. D., \& Pruzansky, S. (1975).  Fitting of hierarchical tree structure (HTS) models, mixtures of HTS models, and hybrid models, via mathematical programming and alternating least squares. \emph{Proceedings of the U.S.-Japan Seminar on Multidimensional Scaling}, 9--19.
 \index{A}{Carroll, J. D.}
 \index{A}{Pruzansky, S.}





\bibitem{} Carroll, J. D., \& Pruzansky, S. (1980).  Discrete and hybrid scaling models.  In E. D. Lantermann \& H. Feger (Eds.), \emph{Similarity and choice} (pp.\ 108--139).  Bern: Hans Huber.

 \index{A}{Carroll, J. D.}
 \index{A}{Pruzansky, S.}
 \index{A}{Lantermann, E. D.}
 \index{A}{Feger, H.}


\bibitem{} Cheney, W., \& Goldstein, A. (1959).  Proximity maps for convex sets. \emph{Proceedings of the American Mathematical Society}, \emph{10}, 448--450.

 \index{A}{Cheney, W.}
 \index{A}{Goldstein, A.}


\bibitem{} Coombs, C. H. (1964). \emph{A theory of data}. New York: Wiley.
 \index{A}{Coombs, C. H.}

\bibitem{} Critchley, F. (1994). On exchangeability-based equivalence
relations induced by strongly Robinson and, in particular, by
quadripolar Robinson dissimilarity matrices.  In B. van Cutsem
(Ed.), \emph{Classification and dissimilarity analysis}, Lecture
Notes in Statistics (pp.\ 173--199).  New York: Springer-Verlag.
 \index{A}{Critchley, F.}
 \index{A}{van Cutsem, B.}

\bibitem{} Critchley, F., \& Fichet, B. (1994). The partial order by
inclusion of the principal classes of dissimilarity on a finite set,
and some of their basic properties. In B. van Cutsem (Ed.),
\emph{Classification and dissimilarity analysis}, Lecture Notes in
Statistics (pp.\ 5--65).  New York: Springer-Verlag.

 \index{A}{Critchley, F.}
 \index{A}{Fichet, B.}
 \index{A}{van Cutsem, B.}


\bibitem{} Day, W. H. E. (1987).  Computational complexity of inferring phylogenies from dissimilarity matrices.  \emph{Bulletin of Mathematical Biology}, \emph{49}, 461--467.
 \index{A}{Day, W. H. E.}

\bibitem{} Day, W. H. E. (1996). Complexity theory: An introduction for practitioners of classification.  In P. Arabie, L. J. Hubert, \& G. De Soete (Eds.), \emph{Clustering and classification} (pp.\ 199--233).  River Edge, New Jersey: World Scientific.

\index{A}{Day, W. H. E.} \index{A}{Hubert, L. J.} \index{A}{Arabie,
P.} \index{A}{De Soete, G.}

\bibitem{} Defays, D. (1978).  A short note on a method of seriation. \emph{British Journal of Mathematical and  Statistical Psychology}, \emph{3}, 49--53.

 \index{A}{Defays, D.}

\bibitem{} de Leeuw, J., \& Heiser, W. J. (1977).  Convergence of correction-matrix algorithms for multidimensional scaling.  In J. C. Lingoes, E. E. Roskam, \& I. Borg (Eds.), \emph{Geometric representations of relational data} (pp.\ 735--752). Ann Arbor, MI: Mathesis Press.
 \index{A}{de Leeuw, J.}
 \index{A}{Heiser, W. J.}
 \index{A}{Lingoes, J. C.}
 \index{A}{Roskam, E. E.}
 \index{A}{Borg, I.}



\bibitem{} De Soete, G. (1983). A least squares algorithm for fitting additive trees to proximity data.  \emph{Psychometrika}, \emph{48}, 621--626.
 \index{A}{De Soete, G.}

\bibitem{} De Soete, G. (1984a). A least squares algorithm for fitting an ultrametric tree to a dissimilarity matrix.  \emph{Pattern Recognition Letters}, \emph{2}, 133--137.
 \index{A}{De Soete, G.}

\bibitem{} De Soete, G. (1984b). Ultrametric tree representations of incomplete dissimilarity data.  \emph{Journal of Classification}, \emph{1}, 235--242.
 \index{A}{De Soete, G.}

\bibitem{} De Soete, G. (1984c). Additive tree representations of incomplete dissimilarity data.  \emph{Quality and Quantity}, \emph{18}, 387--393.
 \index{A}{De Soete, G.}


\bibitem{} De Soete, G., Carroll, J. D., \& DeSarbo, W. S. (1987).  Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data.  \emph{Journal of Classification}, \emph{4}, 155--173.

 \index{A}{De Soete, G.}
 \index{A}{Carroll, J. D.}
 \index{A}{DeSarbo, W. S.}

\bibitem{} De Soete, G., DeSarbo, W. S., Furnas, G. W., \& Carroll, J. D. (1984).  The estimation of ultrametric and path length trees from rectangular proximity data.
 \emph{Psychometrika}, \emph{49}, 289--310.

 \index{A}{De Soete, G.}
 \index{A}{DeSarbo, W. S.}
 \index{A}{Furnas, G. W.}
 \index{A}{Carroll, J. D.}

\bibitem{} Durand, C., \& Fichet, B. (1988). One-to-one correspondences in
pyramidal representations: A unified approach.  In H. H. Bock (Ed.),
\emph{Classification and related methods of data analysis} (pp.\
85--90). Amsterdam: North-Holland.
 \index{A}{Durand, C.}
 \index{A}{Fichet, B.}
 \index{A}{Bock, H. H.}


\bibitem{} Dykstra, R. L. (1983). An algorithm for restricted least squares regression.  \emph{Journal of the American Statistical Association}, \emph{78}, 837--842.

 \index{A}{Dykstra, R. L.}

\bibitem{} Francis, R. L., \& White, J. A. (1974). \emph{Facility layout and location: An analytical approach}. Englewood Cliffs, NJ: Prentice-Hall.
 \index{A}{Francis, R. L.}
 \index{A}{White, J. A.}

\bibitem{} Furnas, G. W. (1980). Objects and their features: The metric representation of two class data.  Unpublished doctoral dissertation, Stanford University.
 \index{A}{Furnas, G. W.}

\bibitem{} Groenen, P. J. F., Heiser, W. J., \& Meulman, J. J. (1999).  Global optimization in least-squares multidimensional scaling by distance smoothing.  \emph{Journal of Classification}, \emph{16}, 225--254.

 \index{A}{Groenen, P. J. F.}
 \index{A}{Heiser, W. J.}
 \index{A}{Meulman, J. J.}



\bibitem{} Guttman, L. (1968). A general nonmetric technique for finding the smallest coordinate space for a configuration of points.  \emph{Psychometrika}, \emph{33}, 469--506.
 \index{A}{Guttman, L.}

\bibitem{} Hubert, L. J. (1974).  Problems of seriation using a subject by item response matrix.  \emph{Psychological Bulletin}, \emph{81}, 976--983.

\index{A}{Hubert, L. J.}
\bibitem{} Hubert, L. J., \& Arabie, P. (1986). Unidimensional scaling and combinatorial optimization.  In J. de Leeuw, W. J. Heiser, J. J. Meulman, \& F. Critchley (Eds.), \emph{Multidimensional data analysis} (pp.\ 181--196). Leiden, The Netherlands: DSWO Press.

 \index{A}{Hubert, L. J.}
 \index{A}{Arabie, P.}
 \index{A}{de Leeuw, J.}
 \index{A}{Heiser, W. J.}
 \index{A}{Meulman, J. J.}
 \index{A}{Critchley, F.}



\bibitem{} Hubert, L. J., \& Arabie, P. (1994). The analysis of proximity
matrices through sums of matrices having (anti-)Robinson forms.
\emph{British Journal of Mathematical and Statistical Psychology},
\emph{47}, 1--40.
 \index{A}{Hubert, L. J.}
 \index{A}{Arabie, P.}

\bibitem{} Hubert, L. J., \& Arabie, P. (1995a). The approximation of two-mode proximity matrices by sums of order-constrained matrices. \emph{Psychometrika}, \emph{60}, 573--605.

 \index{A}{Hubert, L. J.}
 \index{A}{Arabie, P.}


\bibitem{} Hubert, L. J., \& Arabie, P. (1995b). Iterative projection
strategies for the least-squares fitting of tree structures to
proximity data. \emph{British Journal of Mathematical and
Statistical Psychology}, \emph{48}, 281--317.

 \index{A}{Hubert, L. J.}
 \index{A}{Arabie, P.}


\bibitem{} Hubert, L. J., Arabie, P., \& Hesson-McInnis, M. (1992).  Multidimensional scaling in the city-block metric: A combinatorial approach.  \emph{Journal of Classification}, \emph{9}, 211--236.

 \index{A}{Hubert, L. J.}
 \index{A}{Arabie, P.}
 \index{A}{Hesson-McInnis, M.}



\bibitem{} Hubert, L. J., Arabie, P., \& Meulman, J. J. (1997). Linear and
circular unidimensional scaling for symmetric proximity matrices.
\emph{British Journal of Mathematical and Statistical Psychology},
\emph{50}, 253--284.

 \index{A}{Hubert, L. J.}
 \index{A}{Arabie, P.}
 \index{A}{Meulman, J. J.}


 \bibitem{} Hubert, L. J., Arabie, P., \& Meulman, J. J. (1998)  Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices. \emph{Psychometrika}, \emph{63}, 341--358.
 \index{A}{Hubert, L. J.}
 \index{A}{Arabie, P.}
 \index{A}{Meulman, J. J.}

\bibitem{} Hubert, L. J., Arabie, P., \& Meulman, J. J. (2001). \emph{Combinatorial data analysis: Optimization by dynamic programming}. Philadelphia: SIAM.

 \index{A}{Hubert, L. J.}
 \index{A}{Arabie, P.}
 \index{A}{Meulman, J. J.}



\bibitem{} Hubert, L. J., Arabie, P., \& Meulman, J. J. (2002).  Linear unidimensional scaling in the $L_{2}$-norm: Basic optimization methods using MATLAB .  \emph{Journal of Classification}, \emph{19}, 303--328.

 \index{A}{Hubert, L. J.}
 \index{A}{Arabie, P.}
 \index{A}{Meulman, J. J.}





\bibitem{} Hubert, L. J., \& Schultz, J. W. (1976). Quadratic assignment as a general data analysis strategy. \emph{British Journal of Mathematical and Statistical Psychology}, \emph{29}, 190--241.


 \index{A}{Hubert, L. J.}
 \index{A}{Schultz, J. W.}

\bibitem{} Hutchinson, J. W. (1989).  NETSCAL: A network scaling algorithm for nonsymmetric proximity data. \emph{Psychometrika}, \emph{54}, 25--51.

 \index{A}{Hutchinson, J. W.}


\bibitem{} Kaczmarz, S. (1937). Angen\"{a}herte Aufl\"{o}sung von Systemen linearer Gleichungen. \emph{Bulletin of the Polish Academy of Sciences}, \emph{A35}, 355--357.
 \index{A}{Kaczmarz, S.}

\bibitem{} Klauer, K. C., \& Carroll, J. D. (1989). A mathematical programming approach to fitting general graphs. \emph{Journal of Classification}, \emph{6}, 247--270.
 \index{A}{Klauer, K. C.}
 \index{A}{Carroll, J. D.}

\bibitem{} Klauer, K. C., \& Carroll, J. D. (1991). A comparison of two approaches to fitting directed graphs to nonsymmetric proximity measures. \emph{Journal of Classification}, \emph{8}, 251--268.
 \index{A}{Klauer, K. C.}
 \index{A}{Carroll, J. D.}

\bibitem{} K\u{r}iv\'{a}nek, M. (1986). On the computational complexity of clustering.  In E. Diday, Y. Escoufier, L. Lebart, J. P. Pag\`{e}s, Y. Schektman, \& R. Tomassone (Eds.), \emph{Data analysis and informatics, IV}(pp.\ 89--96).  Amsterdam: North-Holland.
 \index{A}{K\u{r}iv\'{a}nek, M.}
 \index{A}{Diday, E.}
 \index{A}{Escoufier, Y.}
 \index{A}{Lebart, L.}
 \index{A}{Pag\`{e}s, J. P.}
 \index{A}{Schektman, Y.}
 \index{A}{Tomassone, R.}

\bibitem{} K\u{r}iv\'{a}nek, M., \& Mor\'{a}vek, J. (1986). NP-hard problems in hierarchical-tree clustering.  \emph{Acta Informatica}, \emph{23}, 311--323.
 \index{A}{K\u{r}iv\'{a}nek, M.}
 \index{A}{Mor\'{a}vek, J.}

\bibitem{} Johnson, R. A., \& Wichern, D. W. (2002). \emph{Applied multivariate statistical analysis}. Fifth Edition. Upper Saddle River, NJ: Prentice-Hall.

 \index{A}{Johnson, R. A.}
 \index{A}{Wichern, D. W.}


\bibitem{} Kruskal, J. B. (1964a).  Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis.  \emph{Psychometrika}, \emph{29}, 1--27.

 \index{A}{Kruskal, J. B.}


 \bibitem{} Kruskal, J. B. (1964b).  Nonmetric multidimensional scaling: A numerical method.  \emph{Psychometrika},
 \emph{29}, 115--129.

 \index{A}{Kruskal, J. B.}


\bibitem{} Kruskal, J. B., Young, F. W., \& Seery, J. B. (1977). \emph{How to use KYST2, a very flexible program to do multidimensional  scaling and unfolding}. AT\&T Bell Laboratories, Murray Hill, NJ.

 \index{A}{Kruskal, J. B.}
 \index{A}{Young, F. W.}
 \index{A}{Seery, J. B.}

 \bibitem{} Kruskal, J. B., \& Wish, M. (1978). \emph{Multidimensional scaling}.  Newbury Park, CA: Sage.
 \index{A}{Kruskal, J. B.}
 \index{A}{Wish, M.}

\bibitem{} Lawler, E. L. (1975).  The quadratic assignment problem: A brief review.  In R. Roy (Ed.), \emph{Combinatorial programming: Methods and applications} (pp.\ 351--360).  Dordrecht, The Netherlands: Reidel.
 \index{A}{Lawler, E. L.}


 \bibitem{} Mardia, K. V., Kent, J. T., \& Bibby, J. M. (1979). \emph{Multivariate analysis}. New York: Academic Press.

 \index{A}{Mardia, K. V.}
 \index{A}{Kent, J. T.}
 \index{A}{Bibby, J. M.}


\bibitem{} Marks, W. B. (1965). \emph{Difference spectra of the visual pigments in single goldfish cones}. Unpublished doctoral dissertation, John Hopkins University.

 \index{A}{Marks, W. B.}

\bibitem{} Mirkin, B. (1996). \emph{Mathematical classification and clustering}.  Dordrecht: Kluwer.

 \index{A}{Mirkin, B.}

\bibitem{} Pardalos, P. M., \& Wolkowicz, H. (Eds.). (1994). \emph{Quadratic assignment and related problems}.  DIMACS Series on Discrete Mathematics and Theoretical Computer Science.  Providence, RI: American Mathematical Society.

 \index{A}{Pardalos, P. M.}
 \index{A}{Wolkowicz, H.}


\bibitem{} Plutchik, R. \& Conte, H. R. (Eds.). (1997). \emph{Circumplex models of personality and emotions}. Washington, DC: American Psychological Association.

\index{A}{Plutchik, R.} \index{A}{Conte, H. R.}


\bibitem{} Pruzansky, S., Tversky, A., \& Carroll, J. D. (1982) Spatial versus tree representations of proximity data. \emph{Psychometrika}, \emph{47}, 3--24.

 \index{A}{Pruzansky, S.}
 \index{A}{Tversky, A.}
 \index{A}{Carroll, J. D.}

\bibitem{} Rothkopf, E. Z. (1957). A measure of stimulus similarity and errors in some paired-associate learning
tasks. \emph{Journal of Experimental Psychology}, \emph{53},
94--101.

 \index{A}{Rothkopf, E. Z.}


\bibitem{} Schiffman, H., \& Falkenberg, P. (1968). The organization of stimuli and sensory neurons.  \emph{Physiology and Behavior}, \emph{3}, 197--201.
 \index{A}{Schiffman, H.}
 \index{A}{Falkenberg, P.}


\bibitem{} Schiffman, S. S., Reynolds, M. L., \& Young, F. W. (1981). \emph{Introduction to multidimensional scaling}.  New York: Academic Press.

 \index{A}{Schiffman, S. S.}
 \index{A}{Reynolds, M. L.}
 \index{A}{Young, F. W.}



\bibitem{} Shepard, R. N. (1962a).  Analysis of proximities: Multidimensional scaling with an unknown distance function I. \emph{Psychometrika}, \emph{27}, 125--140.

 \index{A}{Shepard, R. N.}


\bibitem{} Shepard, R. N. (1962b).  Analysis of proximities:  Multidimensional scaling with an unknown distance function II. \emph{Psychometrika}, \emph{27}, 219--246.
 \index{A}{Shepard, R. N.}

\bibitem{} Shepard, R. N. (1963). Analysis of proximities as a technique for the study of information processing
in man. \emph{Human Factors}, \emph{5}, 33--48.

\index{A}{Shepard, R. N.}
\bibitem{} Shepard, R. N. (1974). Representation of structure in similarity data: Problems and prospects. \emph{Psychometrika}, \emph{39}, 373--421.
 \index{A}{Shepard, R. N.}

\bibitem{} Shepard, R. N., Kilpatric, D. W., \& Cunningham, J. P. (1975).
The internal representation of numbers. \emph{Cognitive Psychology},
\emph{7}, 82--138.
 \index{A}{Shepard, R. N.}
 \index{A}{Kilpatric, D. W.}
 \index{A}{Cunningham, J. P.}



\bibitem{} Sp\"{a}th, H. (1991). \emph{Mathematical algorithms for linear regression}.  San Diego: Academic Press.

 \index{A}{Sp\"{a}th, H.}


\bibitem{} Wilkinson, L. (1988).  \emph{SYSTAT: The System for Statistics}.   SYSTAT, Inc, Evanston, IL.
 \index{A}{Wilkinson, L.}


\end{thebibliography}
