Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
From MaRDI portal
Publication:1566111
DOI10.1007/S003570000019zbMATH Open1137.91602OpenAlexW2029762080MaRDI QIDQ1566111FDOQ1566111
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
Cited In (21)
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
- Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition
- New exact approaches to row layout problems
- A survey for the quadratic assignment problem
- Deep two-way matrix reordering for relational data analysis
- Disentangling relationships in symptom networks using matrix permutation methods
- Combinatorial individual differences scaling within the city-block metric
- Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique
- Improved exact approaches for row layout problems with departments of equal length
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- A parallel ordering problem in facilities layout
- The local minima problem in hierarchical classes analysis: an evaluation of a simulated annealing algorithm and various multistart procedures
- Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- A nonmonotone GRASP
- A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- Continuation methods for approximate large scale object sequencing
- A multi-parent genetic algorithm for the quadratic assignment problem
- Effective formulation reductions for the quadratic assignment problem
Uses Software
This page was built for publication: Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1566111)
