Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
From MaRDI portal
Publication:1566111
DOI10.1007/s003570000019zbMath1137.91602OpenAlexW2029762080MaRDI QIDQ1566111
Stephanie Stahl, Michael J. Brusco
Publication date: 25 September 2003
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003570000019
Related Items
A multi-parent genetic algorithm for the quadratic assignment problem ⋮ Disentangling relationships in symptom networks using matrix permutation methods ⋮ A survey for the quadratic assignment problem ⋮ A parallel ordering problem in facilities layout ⋮ Improved exact approaches for row layout problems with departments of equal length ⋮ A nonmonotone GRASP ⋮ Deep two-way matrix reordering for relational data analysis ⋮ Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition ⋮ A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices ⋮ Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis ⋮ Continuation methods for approximate large scale object sequencing ⋮ Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique ⋮ Experimental analysis of crossover and mutation operators on the quadratic assignment problem ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM ⋮ Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming ⋮ Effective formulation reductions for the quadratic assignment problem ⋮ Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems ⋮ The local minima problem in hierarchical classes analysis: an evaluation of a simulated annealing algorithm and various multistart procedures ⋮ New exact approaches to row layout problems ⋮ Combinatorial individual differences scaling within the city-block metric
Uses Software
