default search action
Michael J. Brusco
Person information
- affiliation: Florida State University, College of Business, Tallahassee, FL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j45]Michael J. Brusco
, Douglas L. Steinley, Ashley L. Watts:
A maximal-clique-based set-covering approach to overlapping community detection. Optim. Lett. 18(6): 1491-1510 (2024) - 2022
- [j44]Michael J. Brusco
Solving Classic Discrete Facility Location Problems Using Excel Spreadsheets. INFORMS Trans. Educ. 22(3): 160-171 (2022) - [j43]Michael J. Brusco
Logistic Regression via Excel Spreadsheets: Mechanics, Model Selection, and Relative Predictor Importance. INFORMS Trans. Educ. 23(1): 1-11 (2022) - [j42]Michael J. Brusco, Douglas L. Steinley:
A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data. Optim. Lett. 16(1): 153-174 (2022) - 2021
- [j41]Collin Huse, Michael J. Brusco
A Tale of Two Linear Programming Formulations for Crashing Project Networks. INFORMS Trans. Educ. 21(2): 82-95 (2021)
2010 – 2019
- 2019
- [j40]Douglas L. Steinley, Michael J. Brusco:
Using an Iterative Reallocation Partitioning Algorithm to Verify Test Multidimensionality. J. Classif. 36(3): 397-413 (2019) - [j39]Michael J. Brusco, Clay M. Voorhees, Roger J. Calantone, Michael K. Brady, Douglas L. Steinley:
Integrating linear discriminant analysis, polynomial basis expansion, and genetic search for two-group classification. Commun. Stat. Simul. Comput. 48(6): 1623-1636 (2019) - [j38]Michael J. Brusco, Douglas L. Steinley, Hans-Friedrich Köhn:
Residual analysis for unidimensional scaling in the L2-norm. Commun. Stat. Simul. Comput. 48(7): 2210-2221 (2019) - [j37]Michael J. Brusco, Patrick Doreian:
Partitioning signed networks using relocation heuristics, tabu search, and variable neighborhood search. Soc. Networks 56: 70-80 (2019) - 2018
- [j36]Noyan Ilk
Workforce management in omnichannel service centers with heterogeneous channel response urgencies. Decis. Support Syst. 105: 13-23 (2018) - [j35]Michael J. Brusco, Hannah J. Stolze
Deterministic Blockmodeling of Two-Mode Binary Networks Using a Two-Mode KL-Median Heuristic. J. Soc. Struct. 19(1) (2018) - 2017
- [j34]Michael J. Brusco:
Partitioning methods for pruning the Pareto set with application to multiobjective allocation of a cross-trained workforce. Comput. Ind. Eng. 111: 29-38 (2017) - 2015
- [j33]Michael J. Brusco:
An iterated local search heuristic for cell formation. Comput. Ind. Eng. 90: 292-304 (2015) - [j32]Douglas L. Steinley, Gretchen Hendrickson, Michael J. Brusco:
A Note on Maximizing the Agreement Between Partitions: A Stepwise Optimal Algorithm and Some Properties. J. Classif. 32(1): 114-126 (2015) - [j31]Michael J. Brusco, Douglas L. Steinley:
Affinity Propagation and Uncapacitated Facility Location Problems. J. Classif. 32(3): 443-480 (2015) - [j30]Michael J. Brusco, Patrick Doreian:
An Exact Algorithm for the Two-Mode KL-Means Partitioning Problem. J. Classif. 32(3): 481-515 (2015) - [j29]Michael J. Brusco:
A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives. Eur. J. Oper. Res. 247(1): 46-59 (2015) - [j28]Michael J. Brusco, Patrick Doreian:
A real-coded genetic algorithm for two-mode KL-means partitioning with application to homogeneity blockmodeling. Soc. Networks 41: 26-35 (2015) - [j27]Michaela Hoffman
A note on using the adjusted Rand index for link prediction in networks. Soc. Networks 42: 72-79 (2015) - 2014
- [j26]Michael J. Brusco:
A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis. Comput. Stat. Data Anal. 77: 38-53 (2014) - 2013
- [j25]Michael J. Brusco, Hans-Friedrich Köhn, Douglas L. Steinley:
Exact and approximate methods for a one-dimensional minimax bin-packing problem. Ann. Oper. Res. 206(1): 611-626 (2013) - [j24]Michael J. Brusco, Patrick Doreian, Paulette Lloyd, Douglas L. Steinley:
A variable neighborhood search method for a two-mode blockmodeling problem in social network analysis. Netw. Sci. 1(2): 191-212 (2013) - 2012
- [j23]Ying Liu
A unified framework for market segmentation and its applications. Expert Syst. Appl. 39(11): 10292-10302 (2012) - 2011
- [j22]Michael J. Brusco, Douglas L. Steinley:
Exact and approximate algorithms for variable selection in linear discriminant analysis. Comput. Stat. Data Anal. 55(1): 123-131 (2011) - [j21]Michael J. Brusco, T. R. Johns:
An integrated approach to shift-starting time selection and tour-schedule construction. J. Oper. Res. Soc. 62(7): 1357-1364 (2011) - [j20]Douglas L. Steinley, Michael J. Brusco, Stanley Wasserman:
Clusterwise p* models for social network analysis. Stat. Anal. Data Min. 4(5): 487-496 (2011) - [j19]Michael J. Brusco:
An exact algorithm for a core/periphery bipartitioning problem. Soc. Networks 33(1): 12-19 (2011) - [j18]Michael J. Brusco:
Analysis of two-mode network data using nonnegative matrix factorization. Soc. Networks 33(3): 201-210 (2011) - 2010
- [j17]Rick L. Andrews, Michael J. Brusco, Imran S. Currim:
Amalgamation of partitions from multiple segmentation bases: A comparison of non-model-based and model-based methods. Eur. J. Oper. Res. 201(2): 608-618 (2010) - [j16]Ying Liu
Multicriterion Market Segmentation: A New Model, Implementation, and Evaluation. Mark. Sci. 29(5): 880-894 (2010)
2000 – 2009
- 2009
- [j15]Michael J. Brusco, Douglas L. Steinley, J. Dennis Cradit:
An Exact Algorithm for Hierarchically Well-Formulated Subsets in Second-Order Polynomial Regression. Technometrics 51(3): 306-315 (2009) - 2008
- [j14]Michael J. Brusco, Douglas L. Steinley:
A Binary Integer Program to Maximize the Agreement Between Partitions. J. Classif. 25(2): 185-193 (2008) - [j13]Michael J. Brusco:
Scheduling advertising slots for television. J. Oper. Res. Soc. 59(10): 1363-1372 (2008) - 2007
- [j12]Douglas L. Steinley, Michael J. Brusco:
Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques. J. Classif. 24(1): 99-121 (2007) - [j11]Michael J. Brusco:
Measuring Human Performance on Clustering Problems: Some Potential Objective Criteria and Experimental Research Opportunities. J. Probl. Solving 1(2) (2007) - 2006
- [j10]Michael J. Brusco:
On the Performance of Simulated Annealing for Large-Scale L2 Unidimensional Scaling. J. Classif. 23(2): 255-268 (2006) - 2002
- [j9]Michael J. Brusco:
Integer Programming Methods for Seriation and Unidemensional Scaling of Proximity Matrices: A Review and Some Extensions. J. Classif. 19(1): 45-67 (2002) - 2001
- [j8]Michael J. Brusco:
A Simulated Annealing Heuristic for Unidimensional and Multidimensional (City-Block) Scaling of Symmetric Proximity Matrices. J. Classif. 18(1): 3-33 (2001) - [j7]Michael J. Brusco:
Combinatorial Data Analysis: Optimization by Dynamic Programming, by L. Hubert, P. Arabie, and J. Meulman. J. Classif. 18(2): 276-280 (2001) - [j6]Michael J. Brusco, Larry W. Jacobs:
Starting-time decisions in labor tour scheduling: An experimental analysis and case study. Eur. J. Oper. Res. 131(3): 459-475 (2001) - 2000
- [j5]Michael J. Brusco, Stephanie Stahl:
Using Quadratic Assignment Methods to Generate Initial Permutations for Least-Squares Unidimensional Scaling of Symmetric Proximity Matrices. J. Classif. 17(2): 197-223 (2000)
1990 – 1999
- 1999
- [j4]Michael J. Brusco, Larry W. Jacobs, Gary M. Thompson:
A morphing procedure to supplement a simulated annealing heuristic for cost- andcoverage-correlated set-covering problems. Ann. Oper. Res. 86: 611-627 (1999) - 1998
- [j3]Michael J. Brusco, Larry W. Jacobs:
Eliminating redundant columns in continuous tour scheduling problems. Eur. J. Oper. Res. 111(3): 518-525 (1998) - 1995
- [j2]Michael J. Brusco, Larry W. Jacobs, Robert J. Bongiorno, Duane V. Lyons, Baoxing Tang:
Improving Personnel Scheduling at Airline Stations. Oper. Res. 43(5): 741-751 (1995) - 1994
- [j1]Stephen E. Bechtold, Michael J. Brusco:
A microcomputer-based heuristic for tour scheduling of a mixed workforce. Comput. Oper. Res. 21(9): 1001-1009 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: