Publication | Date of Publication | Type |
---|
Combining diversity and dispersion criteria for anticlustering: A bicriterion approach | 2024-04-12 | Paper |
Deterministic blockmodelling of signed and two‐mode networks: A tutorial with software and psychological examples | 2024-04-12 | Paper |
Residual analysis for unidimensional scaling in the L2-norm | 2022-07-01 | Paper |
Integrating linear discriminant analysis, polynomial basis expansion, and genetic search for two-group classification | 2022-06-30 | Paper |
Disentangling relationships in symptom networks using matrix permutation methods | 2022-05-25 | Paper |
K-medoids inverse regression | 2022-05-20 | Paper |
An integrated dominance analysis and dynamic programing approach for measuring predictor importance for customer satisfaction | 2022-05-20 | Paper |
A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data | 2022-01-21 | Paper |
Ising formulations of some graph-theoretic problems in psychological research: models and methods | 2021-11-12 | Paper |
Clusterwise p* models for social network analysis | 2020-10-14 | Paper |
Using an iterative reallocation partitioning algorithm to verify test multidimensionality | 2020-03-06 | Paper |
Affinity propagation: An exemplar‐based tool for clustering in psychological research | 2019-03-11 | Paper |
Model selection for minimum‐diameter partitioning | 2019-01-31 | Paper |
Heuristic cognitive diagnosis when the Q‐matrix is unknown | 2019-01-31 | Paper |
An evaluation of exact methods for the multiple subset maximum cardinality selection problem | 2019-01-31 | Paper |
Gaussian model‐based partitioning using iterated local search | 2019-01-31 | Paper |
A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis | 2018-11-23 | Paper |
A note on the expected value of the Rand index | 2018-05-24 | Paper |
A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives | 2016-10-06 | Paper |
On the performance of simulated annealing for large-scale \(L_{2}\) unidimensional scaling | 2016-04-01 | Paper |
Affinity propagation and uncapacitated facility location problems | 2016-02-29 | Paper |
An exact algorithm for the two-mode \(KL\)-means partitioning problem | 2016-02-29 | Paper |
An exact method for partitioning dichotomous items within the framework of the monotone homogeneity model | 2016-01-29 | Paper |
A note on maximizing the agreement between partitions: a stepwise optimal algorithm and some properties | 2015-07-08 | Paper |
A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning | 2015-03-06 | Paper |
Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming | 2015-03-05 | Paper |
Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis | 2014-12-10 | Paper |
A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices | 2014-10-15 | Paper |
An interactive multiobjective programming approach to combinatorial data analysis | 2014-08-06 | Paper |
A variable-selection heuristic for K-means clustering | 2014-08-06 | Paper |
Compact integer-programming models for extracting subsets of stimuli from confusion matrices | 2014-08-06 | Paper |
Multiobjective blockmodeling for social network analysis | 2014-03-31 | Paper |
An Exact Algorithm for Blockmodeling of Two-Mode Network Data | 2013-11-05 | Paper |
Exact and approximate methods for a one-dimensional minimax bin-packing problem | 2013-09-03 | Paper |
Exact and approximate algorithms for variable selection in linear discriminant analysis | 2012-09-15 | Paper |
A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems | 2012-08-24 | Paper |
Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling | 2012-02-19 | Paper |
A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices | 2012-01-11 | Paper |
Neighborhood search heuristics for selecting hierarchically well-formulated subsets in polynomial regression | 2010-02-12 | Paper |
Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence | 2010-01-15 | Paper |
Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem | 2010-01-07 | Paper |
Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis | 2010-01-07 | Paper |
Amalgamation of partitions from multiple segmentation bases: a comparison of non-model-based and model-based methods | 2009-11-16 | Paper |
Exemplar-based clustering via simulated annealing | 2009-11-05 | Paper |
A binary integer program to maximize the agreement between partitions | 2009-10-13 | Paper |
Scheduling advertising slots for television | 2009-03-03 | Paper |
A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning | 2009-01-12 | Paper |
Optimal partitioning of a data set based on the \(p\)-median model | 2008-09-24 | Paper |
Selection of variables in cluster analysis: An empirical comparison of eight procedures | 2008-09-24 | Paper |
Initializing \(K\)-means batch clustering: A critical evaluation of several techniques | 2008-03-11 | Paper |
A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices | 2007-11-30 | Paper |
Inducing a blockmodel structure of two-mode binary data using seriation procedures | 2006-12-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q5706832 | 2005-11-23 | Paper |
ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses | 2005-08-01 | Paper |
Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices | 2005-05-04 | Paper |
Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices. | 2003-09-25 | Paper |
Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming | 2003-04-27 | Paper |
Personnel Tour Scheduling When Starting-Time Restrictions Are Present | 2002-04-17 | Paper |
Integer programming methods for seriation and unidimensional scaling of proximity matrices: A review and some extensions. | 2002-01-01 | Paper |
Starting-time decisions in labor tour scheduling: An experimental analysis and case study | 2001-06-26 | Paper |
A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices. | 2001-01-01 | Paper |
Morph-based local-search heuristics for large-scale combinatorial data analysis | 2000-02-03 | Paper |
A sequential integer programming method for discontinuous labor tour scheduling | 1999-11-29 | Paper |
Working set generation methods for labor tour scheduling | 1999-11-08 | Paper |
Eliminating redundant columns in continuous tour scheduling problems | 1999-11-08 | Paper |
A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems | 1999-06-10 | Paper |
Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations | 1998-07-14 | Paper |
A morph-based simulated annealing heuristic for a modified bin-packing problem | 1998-05-25 | Paper |
Overlapping Start-Time Bands in Implicit Tour Scheduling | 1997-11-12 | Paper |
Improving Personnel Scheduling at Airline Stations | 1996-08-19 | Paper |
Note: A local-search heuristic for large set-covering problems | 1996-02-01 | Paper |
A microcomputer-based heuristic for tour scheduling of a mixed workforce | 1995-01-11 | Paper |
A Simulated Annealing Approach to the Solution of Flexible Labour Scheduling Problems | 1994-04-12 | Paper |
A simulated annealing approach to the cyclic staff-scheduling problem | 1993-06-29 | Paper |