Person:184521: Difference between revisions

From MaRDI portal
Person:184521
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Michael J. Brusco to Michael J. Brusco: Duplicate
 
(No difference)

Latest revision as of 18:51, 8 December 2023

Available identifiers

zbMath Open brusco.michael-jMaRDI QIDQ184521

List of research outcomes





PublicationDate of PublicationType
Combining diversity and dispersion criteria for anticlustering: A bicriterion approach2024-04-12Paper
Deterministic blockmodelling of signed and two‐mode networks: A tutorial with software and psychological examples2024-04-12Paper
Residual analysis for unidimensional scaling in the L2-norm2022-07-01Paper
Integrating linear discriminant analysis, polynomial basis expansion, and genetic search for two-group classification2022-06-30Paper
Disentangling relationships in symptom networks using matrix permutation methods2022-05-25Paper
K-medoids inverse regression2022-05-20Paper
An integrated dominance analysis and dynamic programing approach for measuring predictor importance for customer satisfaction2022-05-20Paper
A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data2022-01-21Paper
Ising formulations of some graph-theoretic problems in psychological research: models and methods2021-11-12Paper
Clusterwise p* models for social network analysis2020-10-14Paper
Using an iterative reallocation partitioning algorithm to verify test multidimensionality2020-03-06Paper
Affinity propagation: An exemplar‐based tool for clustering in psychological research2019-03-11Paper
Model selection for minimum‐diameter partitioning2019-01-31Paper
Heuristic cognitive diagnosis when the Q‐matrix is unknown2019-01-31Paper
An evaluation of exact methods for the multiple subset maximum cardinality selection problem2019-01-31Paper
Gaussian model‐based partitioning using iterated local search2019-01-31Paper
A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis2018-11-23Paper
A note on the expected value of the Rand index2018-05-24Paper
A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives2016-10-06Paper
On the performance of simulated annealing for large-scale \(L_{2}\) unidimensional scaling2016-04-01Paper
Affinity propagation and uncapacitated facility location problems2016-02-29Paper
An exact algorithm for the two-mode \(KL\)-means partitioning problem2016-02-29Paper
An exact method for partitioning dichotomous items within the framework of the monotone homogeneity model2016-01-29Paper
A note on maximizing the agreement between partitions: a stepwise optimal algorithm and some properties2015-07-08Paper
A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning2015-03-06Paper
Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming2015-03-05Paper
Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis2014-12-10Paper
A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices2014-10-15Paper
An interactive multiobjective programming approach to combinatorial data analysis2014-08-06Paper
A variable-selection heuristic for K-means clustering2014-08-06Paper
Compact integer-programming models for extracting subsets of stimuli from confusion matrices2014-08-06Paper
Multiobjective blockmodeling for social network analysis2014-03-31Paper
An Exact Algorithm for Blockmodeling of Two-Mode Network Data2013-11-05Paper
Exact and approximate methods for a one-dimensional minimax bin-packing problem2013-09-03Paper
Exact and approximate algorithms for variable selection in linear discriminant analysis2012-09-15Paper
A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems2012-08-24Paper
Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling2012-02-19Paper
A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices2012-01-11Paper
Neighborhood search heuristics for selecting hierarchically well-formulated subsets in polynomial regression2010-02-12Paper
Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence2010-01-15Paper
Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem2010-01-07Paper
Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis2010-01-07Paper
Amalgamation of partitions from multiple segmentation bases: a comparison of non-model-based and model-based methods2009-11-16Paper
Exemplar-based clustering via simulated annealing2009-11-05Paper
A binary integer program to maximize the agreement between partitions2009-10-13Paper
Scheduling advertising slots for television2009-03-03Paper
A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning2009-01-12Paper
Optimal partitioning of a data set based on the \(p\)-median model2008-09-24Paper
Selection of variables in cluster analysis: An empirical comparison of eight procedures2008-09-24Paper
Initializing \(K\)-means batch clustering: A critical evaluation of several techniques2008-03-11Paper
A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices2007-11-30Paper
Inducing a blockmodel structure of two-mode binary data using seriation procedures2006-12-07Paper
https://portal.mardi4nfdi.de/entity/Q57068322005-11-23Paper
ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses2005-08-01Paper
Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices2005-05-04Paper
Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.2003-09-25Paper
Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming2003-04-27Paper
Personnel Tour Scheduling When Starting-Time Restrictions Are Present2002-04-17Paper
Integer programming methods for seriation and unidimensional scaling of proximity matrices: A review and some extensions.2002-01-01Paper
Starting-time decisions in labor tour scheduling: An experimental analysis and case study2001-06-26Paper
A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices.2001-01-01Paper
Morph-based local-search heuristics for large-scale combinatorial data analysis2000-02-03Paper
A sequential integer programming method for discontinuous labor tour scheduling1999-11-29Paper
Working set generation methods for labor tour scheduling1999-11-08Paper
Eliminating redundant columns in continuous tour scheduling problems1999-11-08Paper
A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems1999-06-10Paper
Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations1998-07-14Paper
A morph-based simulated annealing heuristic for a modified bin-packing problem1998-05-25Paper
Overlapping Start-Time Bands in Implicit Tour Scheduling1997-11-12Paper
Improving Personnel Scheduling at Airline Stations1996-08-19Paper
Note: A local-search heuristic for large set-covering problems1996-02-01Paper
A microcomputer-based heuristic for tour scheduling of a mixed workforce1995-01-11Paper
A Simulated Annealing Approach to the Solution of Flexible Labour Scheduling Problems1994-04-12Paper
A simulated annealing approach to the cyclic staff-scheduling problem1993-06-29Paper

Research outcomes over time

This page was built for person: Michael J. Brusco