A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
From MaRDI portal
Publication:2905131
DOI10.1111/j.2044-8317.2011.02021.xzbMath1245.91086OpenAlexW1910358868WikidataQ43945379 ScholiaQ43945379MaRDI QIDQ2905131
Michael J. Brusco, Douglas Steinley
Publication date: 24 August 2012
Published in: British Journal of Mathematical and Statistical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.2044-8317.2011.02021.x
Multi-objective and goal programming (90C29) Measurement and performance in psychology (91E45) Applications of statistics to psychology (62P15)
Uses Software
Cites Work
- 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
- Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives
- Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
- Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
- Correspondence analysis and optimal structural representations
- The comparison and fitting of given classification schemes
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- An interactive multiobjective programming approach to combinatorial data analysis
- Multi-objective tabu search using a multinomial probability mass function
- Combinatorial Data Analysis
- A branch search algorithm for maximum likelihood paired comparison ranking
- SERIATION USING ASYMMETRIC PROXIMITY MEASURES
- AN ALGORITHM FOR MAXIMUM LIKELIHOOD RANKING AND SLATER'S i FROM PAIRED COMPARISONS
- Generalized proximity function comparisons
- Linear and circular unidimensional scaling for symmetric proximity matrices
- The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms
- The Structural Representation of Proximity Matrices with MATLAB
- Maximum likelihood paired comparison ranking by linear programming
- A branch and bound algorithm for maximum likelihood paired comparison ranking
This page was built for publication: A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
