Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3994799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Treatment of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—A Note on Majority Rule under Transitivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern multidimensional scaling. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority Rule Under Transitivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the performance of simulated annealing for large-scale \(L_{2}\) unidimensional scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive multiobjective programming approach to combinatorial data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5706832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum likelihood paired comparison ranking by linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for maximum likelihood paired comparison ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch search algorithm for maximum likelihood paired comparison ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A More Powerful Method for Triangularizing Input-Output Matrices and the Similarity of Production Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth Packing: A Tabu Search Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tunneling method for global optimization in multidimensional scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization in least-squares multidimensional scaling by distance smoothing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Algorithm for the Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighborhood Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonic models for asymmetric proximities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A More Powerful Method for Triangularizing Input-Output Matrices: A Comment / rank
 
Normal rank
Property / cites work
 
Property / cites work: SERIATION USING ASYMMETRIC PROXIMITY MEASURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative projection strategies for the least‐squares fitting of tree structures to proximity data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and circular unidimensional scaling for symmetric proximity matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Representation of Symmetric Proximity Data: Dimensions and Classifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Data Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear unidimensional scaling in the \(L_2\)-norm: Basic optimization methods using MATLAB. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structural Representation of Proximity Matrices with MATLAB / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensification and diversification with elite tabu search solutions for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A permutation-translation simulated annealing algorithm for \(L_{1}\) and \(L_{2}\) unidimensional scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric unidimensional scaling and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ALGORITHM FOR MAXIMUM LIKELIHOOD RANKING AND SLATER'S i FROM PAIRED COMPARISONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear ordering problem: instances, search space analysis and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving dynamic programming strategies for partitioning / rank
 
Normal rank

Latest revision as of 10:09, 9 July 2024

scientific article
Language Label Description Also known as
English
Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
scientific article

    Statements

    Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2014
    0 references
    combinatorial data analysis
    0 references
    matrix permutation
    0 references
    dynamic programming
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers