Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis
暂无分享,去创建一个
[1] W. S. Robinson. A Method for Chronologically Ordering Archaeological Deposits , 1951, American Antiquity.
[2] E. Rothkopf. A measure of stimulus similarity and errors in some paired-associate learning tasks. , 1957, Journal of experimental psychology.
[3] Hollis B. Chenery,et al. International Comparisons of the Structure of Production , 1958 .
[4] P. Slater. Inconsistencies in a schedule of paired comparisons , 1961 .
[5] Richard Bellman,et al. Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.
[6] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[7] E. Lawler. A Comment on Minimum Feedback Arc Sets , 1964 .
[8] J. P. N. Phillips. A PROCEDURE FOR DETERMINING SLATER'S i AND ALL NEAREST ADJOINING ORDERS , 1967 .
[9] J. P. N. Phillips. A FURTHER PROCEDURE FOR DETERMINING SLATER'S i AND ALL NEAREST ADJOINING ORDERS , 1969 .
[10] J. Decani,et al. Maximum likelihood paired comparison ranking by linear programming , 1969 .
[11] John S. Decani. A branch and bound algorithm for maximum likelihood paired comparison ranking , 1972 .
[12] Franciszek A. Szczotka,et al. On a method of ordering and clustering of objects , 1972 .
[13] C. S. Colantoni,et al. Majority Rule Under Transitivity Constraints , 1973 .
[14] Jean-Marie Blin,et al. Note—A Note on Majority Rule under Transitivity Constraints , 1974 .
[15] James F. Korsh,et al. A branch search algorithm for maximum likelihood paired comparison ranking , 1974 .
[16] R. Shepard,et al. The internal representation of numbers , 1975, Cognitive Psychology.
[17] L. Hubert. SERIATION USING ASYMMETRIC PROXIMITY MEASURES , 1976 .
[18] L. Hubert,et al. Quadratic assignment as a general data analysis strategy. , 1976 .
[19] R. Ranyard. AN ALGORITHM FOR MAXIMUM LIKELIHOOD RANKING AND SLATER'S i FROM PAIRED COMPARISONS , 1976 .
[20] Lawrence Hubert,et al. Applications of combinatorial programming to data analysis: Seriation using asymmetric proximity measures , 1977 .
[21] Ingwer Borg,et al. Geometric representations of relational data : readings in multidimensional scaling , 1977 .
[22] D. Defays. A short note on a method of seriation , 1978 .
[23] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[24] E. Holman. Monotonic models for asymmetric proximities , 1979 .
[25] Reginald G. Golledge,et al. Matrix reorganization and dynamic programming: Applications to paired comparisons and unidimensional seriation , 1981 .
[26] Gerhard Reinelt,et al. A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..
[27] Yukio Fukui. A More Powerful Method for Triangularizing Input-Output Matrices and the Similarity of Production Structures , 1986 .
[28] Phipps Arabie,et al. Combinatorial Data Analysis: Optimization by Dynamic Programming , 1987 .
[29] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[30] J. Leeuw,et al. Multidimensional Data Analysis , 1989 .
[31] Emile H. L. Aarts,et al. Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.
[32] E. Howe. A More Powerful Method for Triangularizing Input-Output Matrices: A Comment , 1991 .
[33] Patrick J. F. Groenen,et al. The majorization approach to multidimensional scaling : some problems and extensions , 1993 .
[34] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[35] Lawrence Hubert,et al. The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms , 1994 .
[36] L. Hubert,et al. Iterative projection strategies for the least-squares fitting of tree structures to proximity data , 1995 .
[37] V. Pliner. Metric unidimensional scaling and global optimization , 1996 .
[38] P. Groenen,et al. The tunneling method for global optimization in multidimensional scaling , 1996 .
[39] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[40] Patrick J. F. Groenen,et al. Modern Multidimensional Scaling: Theory and Applications , 2003 .
[41] Lawrence Hubert,et al. Linear and circular unidimensional scaling for symmetric proximity matrices , 1997 .
[42] Phipps Arabie,et al. The Representation of Symmetric Proximity Data: Dimensions and Classifications , 1998, Comput. J..
[43] Lawrence Hubert,et al. Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices , 1998 .
[44] Rafael Martí,et al. Intensification and diversification with elite tabu search solutions for the linear ordering problem , 1999, Comput. Oper. Res..
[45] P. Groenen,et al. Global Optimization in Least-Squares Multidimensional Scaling by Distance Smoothing , 1999 .
[46] P. Groenen,et al. Modern Multidimensional Scaling: Theory and Applications , 1999 .
[47] Michael J. Brusco,et al. Using Quadratic Assignment Methods to Generate Initial Permutations for Least-Squares Unidimensional Scaling of Symmetric Proximity Matrices , 2000, J. Classif..
[48] Michael J. Brusco. A Simulated Annealing Heuristic for Unidimensional and Multidimensional (City-Block) Scaling of Symmetric Proximity Matrices , 2001, J. Classif..
[49] Michael J. Brusco,et al. An interactive multiobjective programming approach to combinatorial data analysis , 2001 .
[50] M J Brusco. Seriation of asymmetric matrices using integer linear programming. , 2001, The British journal of mathematical and statistical psychology.
[51] Michael J. Brusco,et al. Combinatorial Data Analysis: Optimization by Dynamic Programming, by L. Hubert, P. Arabie, and J. Meulman , 2001, J. Classif..
[52] M. Brusco. Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming , 2002 .
[53] Phipps Arabie,et al. Linear Unidimensional Scaling in the L2-Norm: Basic Optimization Methods Using MATLAB , 2002, J. Classif..
[54] Thomas Stützle,et al. The linear ordering problem: Instances, search space analysis and algorithms , 2004, J. Math. Model. Algorithms.
[55] Jacqueline J. Meulman,et al. Improving Dynamic Programming Strategies for Partitioning , 2004, J. Classif..
[56] Michael J. Brusco,et al. Optimal Least-Squares Unidimensional Scaling: Improved Branch-and-Bound Procedures and Comparison to Dynamic Programming , 2005 .
[57] Stephanie Stahl,et al. Bicriterion seriation methods for skew-symmetric matrices. , 2005, The British journal of mathematical and statistical psychology.
[58] Willem J. Heiser,et al. A Permutation-Translation Simulated Annealing Algorithm for L1 and L2 Unidimensional Scaling , 2005, J. Classif..
[59] M. Brusco,et al. Branch-and-Bound Applications in Combinatorial Data Analysis , 2005 .
[60] Rafael Martí,et al. Variable neighborhood search for the linear ordering problem , 2006, Comput. Oper. Res..
[61] Michael J. Brusco,et al. On the Performance of Simulated Annealing for Large-Scale L2 Unidimensional Scaling , 2006, J. Classif..
[62] Lawrence Hubert,et al. The Structural Representation of Proximity Matrices with MATLAB , 2006 .
[63] M. Brusco,et al. A Comparison of Heuristic Procedures for Minimum Within-Cluster Sums of Squares Partitioning , 2007 .
[64] Pierre Hansen,et al. Variable neighborhood search , 1997, Eur. J. Oper. Res..
[65] F. Glover,et al. Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.