Michael J. Brusco

Orcid: 0000-0002-1465-6233

Affiliations:
  • Florida State University, College of Business, Tallahassee, FL, USA


According to our database1, Michael J. Brusco authored at least 44 papers between 1994 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data.
Optim. Lett., 2022

Logistic Regression via Excel Spreadsheets: Mechanics, Model Selection, and Relative Predictor Importance.
INFORMS Trans. Educ., 2022

Solving Classic Discrete Facility Location Problems Using Excel Spreadsheets.
INFORMS Trans. Educ., 2022

2021
A Tale of Two Linear Programming Formulations for Crashing Project Networks.
INFORMS Trans. Educ., 2021

2019
Partitioning signed networks using relocation heuristics, tabu search, and variable neighborhood search.
Soc. Networks, 2019

Integrating linear discriminant analysis, polynomial basis expansion, and genetic search for two-group classification.
Commun. Stat. Simul. Comput., 2019

Residual analysis for unidimensional scaling in the L2-norm.
Commun. Stat. Simul. Comput., 2019

Using an Iterative Reallocation Partitioning Algorithm to Verify Test Multidimensionality.
J. Classif., 2019

2018
Deterministic Blockmodeling of Two-Mode Binary Networks Using a Two-Mode KL-Median Heuristic.
J. Soc. Struct., 2018

Workforce management in omnichannel service centers with heterogeneous channel response urgencies.
Decis. Support Syst., 2018

2017
Partitioning methods for pruning the Pareto set with application to multiobjective allocation of a cross-trained workforce.
Comput. Ind. Eng., 2017

2015
A note on using the adjusted Rand index for link prediction in networks.
Soc. Networks, 2015

A real-coded genetic algorithm for two-mode KL-means partitioning with application to homogeneity blockmodeling.
Soc. Networks, 2015

A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives.
Eur. J. Oper. Res., 2015

A Note on Maximizing the Agreement Between Partitions: A Stepwise Optimal Algorithm and Some Properties.
J. Classif., 2015

Affinity Propagation and Uncapacitated Facility Location Problems.
J. Classif., 2015

An Exact Algorithm for the Two-Mode KL-Means Partitioning Problem.
J. Classif., 2015

An iterated local search heuristic for cell formation.
Comput. Ind. Eng., 2015

2014
A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis.
Comput. Stat. Data Anal., 2014

2013
A variable neighborhood search method for a two-mode blockmodeling problem in social network analysis.
Netw. Sci., 2013

Exact and approximate methods for a one-dimensional minimax bin-packing problem.
Ann. Oper. Res., 2013

2012
A unified framework for market segmentation and its applications.
Expert Syst. Appl., 2012

2011
Analysis of two-mode network data using nonnegative matrix factorization.
Soc. Networks, 2011

An exact algorithm for a core/periphery bipartitioning problem.
Soc. Networks, 2011

Clusterwise p<sup>*</sup> models for social network analysis.
Stat. Anal. Data Min., 2011

An integrated approach to shift-starting time selection and tour-schedule construction.
J. Oper. Res. Soc., 2011

Exact and approximate algorithms for variable selection in linear discriminant analysis.
Comput. Stat. Data Anal., 2011

2010
Multicriterion Market Segmentation: A New Model, Implementation, and Evaluation.
Mark. Sci., 2010

Amalgamation of partitions from multiple segmentation bases: A comparison of non-model-based and model-based methods.
Eur. J. Oper. Res., 2010

2009
An Exact Algorithm for Hierarchically Well-Formulated Subsets in Second-Order Polynomial Regression.
Technometrics, 2009

2008
Scheduling advertising slots for television.
J. Oper. Res. Soc., 2008

A Binary Integer Program to Maximize the Agreement Between Partitions.
J. Classif., 2008

2007
Measuring Human Performance on Clustering Problems: Some Potential Objective Criteria and Experimental Research Opportunities.
J. Probl. Solving, 2007

Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques.
J. Classif., 2007

2006
On the Performance of Simulated Annealing for Large-Scale L<sub>2</sub> Unidimensional Scaling.
J. Classif., 2006

2002
Integer Programming Methods for Seriation and Unidemensional Scaling of Proximity Matrices: A Review and Some Extensions.
J. Classif., 2002

2001
Starting-time decisions in labor tour scheduling: An experimental analysis and case study.
Eur. J. Oper. Res., 2001

Combinatorial Data Analysis: Optimization by Dynamic Programming, by L. Hubert, P. Arabie, and J. Meulman.
J. Classif., 2001

A Simulated Annealing Heuristic for Unidimensional and Multidimensional (City-Block) Scaling of Symmetric Proximity Matrices.
J. Classif., 2001

2000
Using Quadratic Assignment Methods to Generate Initial Permutations for Least-Squares Unidimensional Scaling of Symmetric Proximity Matrices.
J. Classif., 2000

1999
A morphing procedure to supplement a simulated annealing heuristic for cost- andcoverage-correlated set-covering problems.
Ann. Oper. Res., 1999

1998
Eliminating redundant columns in continuous tour scheduling problems.
Eur. J. Oper. Res., 1998

1995
Improving Personnel Scheduling at Airline Stations.
Oper. Res., 1995

1994
A microcomputer-based heuristic for tour scheduling of a mixed workforce.
Comput. Oper. Res., 1994


  Loading...