A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices

Psychometrika

Volumn 67, Issue 3, 2002, Pages 459-471

  Brusco, Michael J ^a  

^a FLORIDA STATE UNIVERSITY   (United States)

Author keywords

Anti Robinson form; Branch and bound; Combinatorial optimization; Seriation

Indexed keywords

EID: 0036745542     PISSN: 00333123     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02294996     Document Type: Article

References (22)

1. Baker, F.B., & Hubert, L.J. (1977). Applications of combinatorial programming to data analysis: Seriation using asymmetric proximity measures. British Journal of Mathematical and Statistical Psychology, 30, 154-164.
2. Balas, E. (1965). An additive algorithm for solving linear programs with zero-one variables. Operations Research, 13, 517-546.
3. Brusco, M.J., & Stahl, S. (2000). Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices. Journal of Classification, 17, 197-223.
4. Brusco, M.J., & Stahl, S. (2001). An interactive approach to multiobjective combinatorial data analysis. Psychometrika, 66, 5-24.
5. DeCani, J.S. (1972). A branch-and-bound algorithm for maximum likelihood paired comparison ranking. Biometrika, 59, 131-135.
6. Defays, D. (1978). A short note on a method of seriation. British Journal of Mathematical and Statistical Psychology, 31, 49-53.
7. Flueck, J.A., & Korsh, J.F. (1974). A branch search algorithm for maximum likelihood paired comparison ranking. Biometrika, 61, 621-626.
8. Groenen, P.J.F. (1993). The majorization approach to multidimensional scaling: Some problems and extensions. Leiden, Netherlands: DSWO Press.
9. Hubert, L.J. (1976). Seriation using asymmetric proximity measures. British Journal of Mathematical and Statistical Psychology, 29, 32-52.
10. Hubert, L.J. (1987), Assignment methods in combinatorial data analysis. New York, NY: Marcel Dekker.
11. Hubert, L.J., & Arabic, P. (1986). Unidimensional scaling and combinatorial optimization. In J. de Leeuw, W. Heiser, J. Meulman, & F. Critchley (Eds), Multidimensional data analysis (pp. 181-196). Leiden, Netherlands: DSWO Press.
12. Hubert, L., & Arabic, P. (1994). The analysis of proximity matrices through sums of matrices having (anti-) Robinson forms. British Journal of Mathematical and Statistical Psychology, 47, 1-40.
13. Hubert, L., & Arabic, P. (1995). The approximation of two-mode proximity matrices by sums of order-constrained matrices. Psychometrika, 60, 573-605.
14. Hubert, L., Arabic, P., & Meulman, J. (1997). Linear and circular unidimensional scaling for symmetric proximity matrices. British Journal of Mathematical and Statistical Psychology, 50, 253-284.
15. Hubert, L., Arabic, P., & Meulman, J. (1998). Graph-theoretic representations for proximity matrices through strongly anti-Robinson or circular strongly anti-Robinson matrices. Psychometrika, 63, 341-358.
16. Hubert, L., Arabic, P., & Meulman, J. (2001). Combinatorial data analysis: Optimization by dynamic programming. Philadelphia, PA: Society for Industrial and Applied Mathematics.
17. Hubert, L.J., & Golledge, R.G. (1981). Matrix reorganization and dynamic programming: Applications to paired comparisons and unidimensional seriation. Psychometrika, 46, 429-441.
18. Lawler, E.L. (1964). A comment on minimum feedback arc sets. IEEE Transactions on Circuit Theory, 11, 296-297.
19. Robinson, W.S. (1951). A method for chronologically ordering archaeological deposits. American Antiquity, 16, 293-301.
20. Ross, B.H., & Murphy, G.L. (1999). Food for thought: Cross-classification and category organization in a complex real-world domain. Cognitive Psychology, 38, 495-553.
21. Thurstone, L.L. (1959). The measurement of values. Chicago, IL: University of Chicago Press.
22. Younger, D.H. (1963). Minimum feedback arc sets for a directed graph. IEEE Transactions on Circuit Theory, 10, 238-245.