Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
From MaRDI portal
(Redirected from Publication:477965)
Recommendations
- Combinatorial data analysis. Optimization by dynamic programming
- A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices.
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- Morph-based local-search heuristics for large-scale combinatorial data analysis
- Adaptive memory programming for matrix bandwidth minimization
Cites work
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 876715 (Why is no real title available?)
- scientific article; zbMATH DE number 3403649 (Why is no real title available?)
- scientific article; zbMATH DE number 2231543 (Why is no real title available?)
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A Dynamic Programming Approach to Sequencing Problems
- A More Powerful Method for Triangularizing Input-Output Matrices and the Similarity of Production Structures
- A More Powerful Method for Triangularizing Input-Output Matrices: A Comment
- A branch and bound algorithm for maximum likelihood paired comparison ranking
- A branch search algorithm for maximum likelihood paired comparison ranking
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- A permutation-translation simulated annealing algorithm for \(L_{1}\) and \(L_{2}\) unidimensional scaling
- A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices.
- AN ALGORITHM FOR MAXIMUM LIKELIHOOD RANKING AND SLATER'S i FROM PAIRED COMPARISONS
- An interactive multiobjective programming approach to combinatorial data analysis
- Bandwidth Packing: A Tabu Search Approach
- Combinatorial data analysis. Optimization by dynamic programming
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Global optimization in least-squares multidimensional scaling by distance smoothing
- Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices
- Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
- Improving dynamic programming strategies for partitioning
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- Iterative projection strategies for the least‐squares fitting of tree structures to proximity data
- Linear and circular unidimensional scaling for symmetric proximity matrices
- Linear unidimensional scaling in the \(L_2\)-norm: Basic optimization methods using MATLAB.
- Majority Rule Under Transitivity Constraints
- Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
- Maximum likelihood paired comparison ranking by linear programming
- Metric unidimensional scaling and global optimization
- Modern multidimensional scaling. Theory and applications.
- Monotonic models for asymmetric proximities
- Note—A Note on Majority Rule under Transitivity Constraints
- On the performance of simulated annealing for large-scale \(L_{2}\) unidimensional scaling
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
- SERIATION USING ASYMMETRIC PROXIMITY MEASURES
- The Representation of Symmetric Proximity Data: Dimensions and Classifications
- The Structural Representation of Proximity Matrices with MATLAB
- The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms
- The linear ordering problem: instances, search space analysis and algorithms
- The tunneling method for global optimization in multidimensional scaling
- Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
- Variable Neighborhood Search
- Variable neighborhood search for the linear ordering problem
Cited in
(12)- Variable neighbourhood search: Methods and applications
- Disentangling relationships in symptom networks using matrix permutation methods
- A heuristic to accelerate in-situ permutation algorithms
- Variable neighbourhood search: methods and applications
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
- Residual analysis for unidimensional scaling in the L2-norm
- Exemplar-based clustering via simulated annealing
- Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition
- An experimental comparison of seriation methods for one-mode two-way data
- A multi-scale seriation algorithm for clustering sparse imbalanced data: application to spike sorting
- An improved exact algorithm for least-squares unidimensional scaling
- Count network autoregression
This page was built for publication: Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477965)
