scientific article; zbMATH DE number 2231543
From MaRDI portal
Publication:5706832
zbMath1093.62006MaRDI QIDQ5706832
Michael J. Brusco, Stephanie Stahl
Publication date: 23 November 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Research exposition (monographs, survey articles) pertaining to statistics (62-02)
Related Items
Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization ⋮ An improved exact algorithm for least-squares unidimensional scaling ⋮ Disentangling relationships in symptom networks using matrix permutation methods ⋮ A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives ⋮ Are discoveries spurious? Distributions of maximum spurious correlations and their applications ⋮ Inducing a blockmodel structure of two-mode binary data using seriation procedures ⋮ Exact and approximate methods for a one-dimensional minimax bin-packing problem ⋮ Residual analysis for unidimensional scaling in the L2-norm ⋮ Median constrained bucket order rank aggregation ⋮ Globally optimal univariate spline approximations ⋮ An exact method for partitioning dichotomous items within the framework of the monotone homogeneity model ⋮ A review of multiobjective programming and its application in quantitative psychology ⋮ Multiobjective blockmodeling for social network analysis ⋮ Exact and approximate algorithms for variable selection in linear discriminant analysis ⋮ Book review of: J. Kogan, Introduction to clustering large and high-dimensional data ⋮ Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition ⋮ Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis ⋮ Optimal partitioning of a data set based on the \(p\)-median model ⋮ Constrained clustering by constraint programming ⋮ Ising formulations of some graph-theoretic problems in psychological research: models and methods ⋮ An experimental comparison of seriation methods for one-mode two-way data ⋮ An iterated greedy heuristic for a market segmentation problem with multiple attributes ⋮ A structural characterization for certifying Robinsonian matrices ⋮ Parallel branch and bound for multidimensional scaling with city-block distances ⋮ Maximum cut in fuzzy nature: models and algorithms ⋮ Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression ⋮ Taxicab correspondence analysis ⋮ Branch and bound method for multiobjective pairing selection ⋮ Dense and sparse graph partition ⋮ A sampling-based exact algorithm for the solution of the minimax diameter clustering problem ⋮ Sequential composition of linear systems' clans ⋮ Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal ⋮ An exact algorithm for the two-mode \(KL\)-means partitioning problem ⋮ Combinatorial individual differences scaling within the city-block metric ⋮ Seriation and matrix reordering methods: An historical overview ⋮ A graph approach to generate all possible regression submodels ⋮ Branch and bound algorithm for multidimensional scaling with city-block metric ⋮ A multi-scale seriation algorithm for clustering sparse imbalanced data: application to spike sorting ⋮ An Exact Algorithm for Blockmodeling of Two-Mode Network Data ⋮ Seriation using tree-penalized path length ⋮ The weighted sitting closer to friends than enemies problem in the line
Uses Software
