An interactive multiobjective programming approach to combinatorial data analysis
From MaRDI portal
Recommendations
- An interactive heuristic method for multi-objective combinatorial optimization
- An interactive method for multiple-objective mathematical programming problems
- scientific article; zbMATH DE number 19069
- scientific article; zbMATH DE number 3924497
- scientific article; zbMATH DE number 3856799
- Multiobjective combinatorial optimization: some approaches
- scientific article; zbMATH DE number 44121
- scientific article; zbMATH DE number 3970504
- An interactive polyhedral approach for multi-objective combinatorial optimization with incomplete preference information
Cites work
- scientific article; zbMATH DE number 3734973 (Why is no real title available?)
- scientific article; zbMATH DE number 1107546 (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?)
- A Dynamic Programming Approach to Sequencing Problems
- A branch search algorithm for maximum likelihood paired comparison ranking
- An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Assignment Problems and the Location of Economic Activities
- Clusterwise linear regression
- Comparative Evaluation of Some Interactive Approaches to Multicriterion Optimization
- Graphical Representation of Asymmetric Matrices
- Interactive analysis of multiple-criteria project scheduling problems
- Least squares metric, unidimensional scaling of multivariate linear models
- Linear and circular unidimensional scaling for symmetric proximity matrices
- Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
- Metric unidimensional scaling and global optimization
- Models for asymmetric proximities
- Monotonic models for asymmetric proximities
- Proper efficiency and the theory of vector maximization
- QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
- SERIATION USING ASYMMETRIC PROXIMITY MEASURES
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- The interface with decision makers and some experimental results in interactive multiple objective programming methods
- The tunneling method for global optimization in multidimensional scaling
- Unidimensional scaling: A linear programming approach minimizing absolute deviations
- Was Euclid an unnecessarily sophisticated psychologist?
Cited in
(17)- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- Data fusion by T3-PCA: a global model for the simultaneous analysis of coupled three-way and two-way real-valued data
- Multiobjective blockmodeling for social network analysis
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
- Compact integer-programming models for extracting subsets of stimuli from confusion matrices
- Disentangling relationships in symptom networks using matrix permutation methods
- A review of multiobjective programming and its application in quantitative psychology
- Integer programming in psychology: a review and directions for future research
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- The orbiter ecosystem for combinatorial data
- Combinatorial data analysis. Optimization by dynamic programming
- Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
- Morph-based local-search heuristics for large-scale combinatorial data analysis
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
- Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
- An integrated dominance analysis and dynamic programing approach for measuring predictor importance for customer satisfaction
This page was built for publication: An interactive multiobjective programming approach to combinatorial data analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2511823)
