Integer programming methods for seriation and unidimensional scaling of proximity matrices: A review and some extensions

Journal of Classification

Volumn 19, Issue 1, 2002, Pages 45-67

  Brusco, Michael J ^a  

^a FLORIDA STATE UNIVERSITY   (United States)

Author keywords

Integer programming; Seriation; Unidimensional scaling

Indexed keywords

EID: 0036882183     PISSN: 01764268     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00357-001-0032-z     Document Type: Review

References (35)

1. ALI, I., COOK, W. D., and KRESS, M. (1986), "Ordinal Ranking and Intensity of Preference: A Linear Programming Approach," Management Science, 32, 1642-1647.
2. 1 Linear Approximation with Linear Constraints," SIAM Journal on Numerical Analysis, 15, 603-611.
3. 1 Linear Approximation Problem," ACM Transactions on Mathematical Software, 6, 231-235.
4. BLIN, J. M., and WHINSTON, A. B. (1974), "A Note on Majority Rule Under Transitivity Constraints," Management Science, 20, 1439-1440.
5. BOWMAN, V. J., and COLANTONI, C. S. (1973), "Majority Rule Under Transitivity Constraints," Management Science, 19, 1029-1041.
6. BRUSCO, M. J. (2001a). "A Simulated Annealing Heuristic for Unidimensional and Multidimensional (City-Block) Scaling of Symmetric Proximity Matrices," Journal of Classification, 18, 3-33.
7. BRUSCO, M. J. (2001b), "Sedation of Asymmetric Proximity Matrices Using Integer Linear Programming," British Journal of Mathematical and Statistical Psychology, 54, 367375.
8. BRUSCO, M. J. (2002), "A Branch-and-Bound Algorithm for Fitting Anti-Robinson Structures to Symmetric Dissimilarity Matrices," Psychometrika, in press.
9. BRUSCO, M. J., and STAHL, S. (2001), "An Interactive Approach to Multiobjective Combinatorial Data Analysis," Psychometrika, 66, 5-24.
10. CHEN, G. (2000). Metric Two-Way Multidimensional Scaling and Circular Unidimensional Scaling: Mixed Integer Programming Approaches, Doctoral Dissertation, Department of Management Science and Information Systems, Rutgers University, Newark, NJ.
11. COOK, W. D., and KRESS, M. (1992), Ordinal Information and Preference Structures: Decision Models and Applications. Englewood Cliffs, NJ: Prentice-Hall.
12. COOK, W. D., KRESS, M., and SEIFORD, L. M. (1997), "A General Framework for Distance-Based Consensus in Ordinal Ranking Model," European Journal of Operational Research, 96, 392-397.
13. COOK, W. D., and SEIFORD, L. M. (1978), "Priority Ranking and Consensus Formation," Management Science, 24, 1721-1732.
14. COOK, W. D., and SEIFORD, L. M. (1982), "The Borda-Kendall Consensus Method for Priority Ranking Problems," Management Science, 28, 621-637.
15. DASH OPTIMIZATION, INC. (1999), XPRESS-MP, User's Guide and Reference Manual. Englewood Cliffs, NJ: Dash Associates.
16. DECANI, J. S. (1969), "Maximum Likelihood Paired Comparison Ranking by Linear Programming," Biometrika, 56, 537-545.
17. DECANI, J. S. (1972), "A Branch-and-Bound Algorithm for Maximum Likelihood Paired Comparison Ranking," Biometrika, 59, 131-135.
18. FLUECK, J. A., and KORSH, J. F. (1974), "A Branch Search Algorithm for Maximum Likelihood Paired Comparison Ranking," Biometrika, 61, 621-626.
19. GONZÁLEZ-PACHÓN, J., and ROMERO, C. (1999), "Distance-Based Consensus Methods: A Goal Programming Approach," Omega: The International Journal of Management Science, 27, 341-347.
20. GONZÁLEZ-PACHÓN, J., and ROMERO, C. (2001), "Aggregation of Partial Ordinal Rankings: An Interval Goal Programming Approach," Computers & Operations Research, 28, 827-834.
21. GRÖTSCHEL, M., JÜNGER, M., and REINELT, G. (1984), "A Cutting Plane Algorithm for the Linear Ordering Problem," Operations Research, 32, 1195-1220.
22. HANSEN, P., and JAUMARD, B. (1997), "Cluster Analysis and Mathematical Programming," Mathematical Programming, 79, 191-215.
23. HUBERT, L. J., and ARABIE, P. (1986), "Unidimensional Scaling and Combinatorial Optimization," in Multidimensional Data Analysis, Eds., J. de Leeuw, W. Heiser, J. Meulman, and F. Critchley, Leiden, The Netherlands: DSWO Press, 181-196.
24. HUBERT, L., ARABIE, P., and HESSON-MCINNIS, M. (1992), Multidimensional Scaling in the City-Block Metric: A Combinatorial Approach," Journal of Classification, 9, 211-236.
25. HUBERT, L., ARABIE, P., and MEULMAN, J. (2001), Combinatorial Data Analysis: Optimization by Dynamic Programming. Philadelphia: Society for Industrial and Applied Mathematics [SIAM].
26. HUBERT, L. J., and GOLLEDGE, R. G. (1981), "Matrix Reorganization and Dynamic Programming: Applications to Paired Comparisons and Unidimensional Seriation," Psychometrika, 46, 429-441.
27. ILOG CPLEX 6.5 (1999). User's Manual. Mountain View, CA: ILOG, Inc.
28. LAU, K., LEUNG, P. L., and TSE, K. (1998), "A Nonlinear Programming Approach to Metric Unidimensional Scaling," Journal of Classification, 15, 3-14.
29. PADBERG, M. (2000), "Approximating Separable Nonlinear Functions Via Mixed Zero-One Programs," Operations Research Letters, 27, 1-5.
30. ROBINSON, W. S. (1951), "A Method for Chronologically Ordering Archaeological Deposits," American Antiquity, 16, 293-301.
31. SCHRAGE, L. (1991), User's Manual for Linear, Integer, and Quadratic Programming with UNDO Release 5.0. San Francisco: Scientific Press.
32. SHERALI, H. D. (2001), "On Mixed-Integer Zero-One Representations for Separable Lower-Semicontinuous Piecewise-Linear Functions," Operations Research Letters, 28, 155-160.
33. SIMANTIRAKI, E. (1996), "Unidimensional Scaling: A Linear Programming Approach Minimizing Absolute Deviations," Journal of Classification, 13, 19-25.
34. 1 Optimization Under Linear Inequality Constraints," Journal of Classification, 17, 225-242.
35. THURSTONE, L. L. (1959). The Measurement of Values. Chicago: University of Chicago Press.