Matthew J. Saltzman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Matthew J. Saltzman has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Blake Splitter
Mathematics Department Tennessee Wesleyan University Athens Tennessee USA
3 shared publications - Laszlo Ladanyi
IBM T.J. Watson Research Center
2 shared publications - Mary Beth Kurz
Department of Industrial Engineering, Clemson University, Clemson, SC, USA
2 shared publications - Ted K. Ralphs
Lehigh University
2 shared publications - Amy B. Gore
School of Mathematical and Statistical Sciences, Clemson University, Clemson, South Carolina 29634
1 shared publication - Anna Marie Vagnozzi
Epic Systems Corporation
1 shared publication
Latest Publications
A Clustering Approach for NSGA ‐ II in Political Redistricting
Political redistricting is a complex, multi‐objective problem that has been extensively studied. One approach to solve this geographical partitioning problem is to use multiobjective genetic algorithms applied to the adjacency graph of precincts. Following the work of Vanneschi et al., we develop an algorithm using a Non‐Dominated Sorting Genetic Algorithm (NSGA‐II) to build electoral plans in the state of South Carolina. Our work (which we name Cluster‐NSGA‐II) utilizes a novel clustering approach to breed children rather than the standard crossover step. We find that this approach is competitive with other similar algorithms in terms of both solution diversity and Pareto optimality.
A Clustering Approach for NSGA ‐ II in Political Redistricting
Political redistricting is a complex, multi‐objective problem that has been extensively studied. One approach to solve this geographical partitioning problem is to use multiobjective genetic algorithms applied to the adjacency graph of precincts. Following the work of Vanneschi et al., we develop an algorithm using a Non‐Dominated Sorting Genetic Algorithm (NSGA‐II) to build electoral plans in the state of South Carolina. Our work (which we name Cluster‐NSGA‐II) utilizes a novel clustering approach to breed children rather than the standard crossover step. We find that this approach is competitive with other similar algorithms in terms of both solution diversity and Pareto optimality.
- 1 October 2025
- Published by Springer Nature
- p. 223-249
Technology for Redistricting: Assessing and Generating District Maps
- 1 October 2025
- Published by Springer Nature
- p. 223-249
Technology for Redistricting: Assessing and Generating District Maps
- 1 November 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Applied Analytics
- Vol. 52 (6) , 553-567
Clemson University’s Rotational Attendance Plan During COVID-19
The COVID-19 pandemic forced universities to upend their class scheduling. At Clemson University, the administration implemented hybrid schedules for fall 2020, in which students attend classes partly online and partly in person. To limit exposures of COVID-19 in the classroom, we propose two rotational attendance models (the three-cohort model and the once-a-week model) that aim to allow in-person classroom time and minimize exposure between students. In a baseline strategy, students would interact with an average of 84 students per week and attend class in person 2.6 days a week. By contrast, the three-cohort model and once-a-week model achieve about 57 and 83 student interactions per week and 1.6 and 1.9 in-person student attendance days a week, respectively. Although these figures of merit may imply that the three-cohort model is preferable, it achieves its results by forcing about 1,600 of the 21,000 students who want to attend courses in person to participate online instead and forcing courses that meet twice a week to be attended twice in a three-week rotation. Considering the tradeoffs between the figures of merit related to student interaction and anticipated implementation challenges, Clemson University implemented the once-a-week model for fall 2020 and spring 2021. History: This paper was refereed. This article has been selected for inclusion in the Special Issue on Analytics Remedies to COVID-19.
- 1 November 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Applied Analytics
- Vol. 52 (6) , 553-567
Clemson University’s Rotational Attendance Plan During COVID-19
The COVID-19 pandemic forced universities to upend their class scheduling. At Clemson University, the administration implemented hybrid schedules for fall 2020, in which students attend classes partly online and partly in person. To limit exposures of COVID-19 in the classroom, we propose two rotational attendance models (the three-cohort model and the once-a-week model) that aim to allow in-person classroom time and minimize exposure between students. In a baseline strategy, students would interact with an average of 84 students per week and attend class in person 2.6 days a week. By contrast, the three-cohort model and once-a-week model achieve about 57 and 83 student interactions per week and 1.6 and 1.9 in-person student attendance days a week, respectively. Although these figures of merit may imply that the three-cohort model is preferable, it achieves its results by forcing about 1,600 of the 21,000 students who want to attend courses in person to participate online instead and forcing courses that meet twice a week to be attended twice in a three-week rotation. Considering the tradeoffs between the figures of merit related to student interaction and anticipated implementation challenges, Clemson University implemented the once-a-week model for fall 2020 and spring 2021. History: This paper was refereed. This article has been selected for inclusion in the Special Issue on Analytics Remedies to COVID-19.
- 21 November 2020
- Published by Springer Nature
- p. 47-63
Software for an Intelligent Mathematical Programming System
- 21 November 2020
- Published by Springer Nature
- p. 47-63
Software for an Intelligent Mathematical Programming System
- 1 January 2013
- Published by Springer Nature
- p. 1070-1081
Open-Source Software and the Computational Infrastructure for Operations Research (COIN-OR)
- 1 January 2013
- Published by Springer Nature
- p. 1070-1081
Open-Source Software and the Computational Infrastructure for Operations Research (COIN-OR)
- 8 September 2006
- Published by Springer Nature in Annals of Operations Research
- Vol. 147 (1) , 43-70
An improved algorithm for solving biobjective integer programs
- 8 September 2006
- Published by Springer Nature in Annals of Operations Research
- Vol. 147 (1) , 43-70
An improved algorithm for solving biobjective integer programs
- 1 May 2004
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 28 (2) , 215-234
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms
- 1 May 2004
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 28 (2) , 215-234
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms
- 1 September 2003
- Published by Springer Nature in Mathematical Programming
- Vol. 98 (1-3) , 253-280
Parallel branch, cut, and price for large-scale discrete optimization
- 1 September 2003
- Published by Springer Nature in Mathematical Programming
- Vol. 98 (1-3) , 253-280
Parallel branch, cut, and price for large-scale discrete optimization