SCSohom Chatterjee

Sohom Chatterjee

*This is an algorithmically generated author record based on publicly available information.

Sohom Chatterjee has a total of 7 co-authors. Here are the top co-authors by number of shared publications:

  • Hrayer Aprahamian

    Department of Industrial and Systems Engineering, Texas A&M University, College Station, Texas 77840

    4 shared publications
  • Lewis Ntaimo

    Wm Michael Barnes ‘64 Department of Industrial & Systems Engineering, Texas A&M University, College Station, Texas 77840

    3 shared publications
  • Youssef Hebaish

    Wm Michael Barnes ‘64 Department of Industrial & Systems Engineering, Texas A&M University, College Station, Texas 77840

    3 shared publications
  • Hrayer Aprahamian

    Department of Industrial and Systems Engineering Texas A&M University College Station Texas USA

    2 shared publications
  • Su Li

    Department of Industrial and Systems Engineering, Texas A&M University, College Station, Texas 77840

    2 shared publications
  • James Deegear

    Counseling & Psychological Services, Texas A&M University, USA

    1 shared publication

Latest Publications

  • A Convex Relaxation-Based Spatial Branching Approach for Optimal Robust Group Testing Designs Under Prevalence Rate and Dilution Behavior Uncertainty

    by Su Li, Hrayer Aprahamian, Sohom Chatterjee

    Group testing is a widely adopted strategy for screening large populations for infectious diseases. Its efficiency is heavily influenced by the prevalence rate and the dilution effect of pooling, a phenomenon in which test accuracy deteriorates for large group sizes. Both factors are highly uncertain, motivating the need for robust testing schemes. In this paper, we introduce a novel regret-based formulation of the Dorfman group testing problem that accounts for uncertainty in both the prevalence rate and the dilution behavior of the assay. To solve the resulting minimax regret problem, we recast it as a more tractable conventional minimax problem and solve the nonconvex reformulation via spatial branching with convex relaxations. We derive theoretical properties for efficiently constructing convex underestimators that are guaranteed to converge to the original objective and use these to prove the algorithm’s convergence to an [ ]-optimal solution. A case study on COVID-19 with real clinical data demonstrates the algorithm’s efficiency and shows that robust testing schemes reduce maximum regret while improving both testing costs and classification accuracy. History: Accepted by J. Paul Brooks, Area Editor for Applications in Biology, Medicine, & Healthcare. Funding: This material is based on work supported in part by the National Science Foundation [Grant 2414715]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0465 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0465 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

  • Code and Data Repository for A Convex Relaxation-based Spatial Branching Approach for Optimal Robust Group Testing Designs under Prevalence Rate and Dilution Behavior Uncertainty

    by Su Li, Hrayer Aprahamian, Sohom Chatterjee

    The software and data in this repository are a snapshot of the software and data that were used in the research reported on in the paper A Convex Relaxation-based Spatial Branching Approach for Optimal Robust Group Testing Designs under Prevalence Rate and Dilution Behavior Uncertainty by S. Li, H. Aprahamian, and S. Chatterjee.


  • An Optimization-Based Scheduling Methodology for Appointment Systems with Heterogeneous Customers and Nonstationary Arrival Processes

    by Sohom Chatterjee, Youssef Hebaish, Hrayer Aprahamian, Lewis Ntaimo

    In this paper, we analyze appointment systems involving heterogeneous customers, each requesting different services, with nonstationary arrival processes. The main goal is to identify server schedules that lead to good-performing systems, which we measure through the expected system time and the number of customer rejections. This decision problem arises in a number of applications and is especially relevant when certain service types dominate other service types. A key challenge in this analysis is the lack of closed-form analytical expressions that characterize the performance of the system. In this work, we construct a stylized optimization model based on a pointwise stationary approximation that emulates the original stochastic system. An analysis of the resulting stylized model comprised of a single customer type leads to key structural properties which we use to devise a globally convergent solution scheme that runs in polynomial time. This solution scheme is then generalized to the case of multiple customer types for two different formulations of the decision problem. To demonstrate the effectiveness of the proposed framework, we conduct a case study on Texas A&M University’s College and Psychological Services. Our results show that our optimal solutions substantially improve the performance of the system over current practices by reducing access time for critical mental health services by as much as 56%. Our analysis also identifies an easily implementable scheduling policy consisting of a single modification whose performance is within 10% of the more complex policies. History: Accepted by J. Paul Brooks, Area Editor for Applications in Biology, Medicine, & Healthcare. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0039 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0039 . The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .


  • Code and Data Repository for An Optimization-Based Scheduling Methodology for Appointment Systems with Heterogeneous Customers and Nonstationary Arrival Processes

    by Sohom Chatterjee, Youssef Hebaish, Hrayer Aprahamian, Lewis Ntaimo

    The data folder includes the arrival rate data for first-time and crisis customers and the optimal schedule proportions for both service types for all the cases in Table 1 and Figure 9 of the paper. It also contains the schedule proportions obtained using the DPS policy, as shown in Figure 10 of the paper. Refer to the README.md file in that folder for more details on the data.


  • Open Access

    Capturing the dilution effect of risk‐based grouping with application to COVID‐19 screening

    by Sohom Chatterjee, Hrayer Aprahamian

    We investigate the problem of screening a large population for an infectious disease (i.e., classifying subjects as positive or negative) using group testing while considering important test and population‐level characteristics. Group testing, in which multiple samples are pooled together into a master sample and tested simultaneously, has the potential to significantly expand screening efforts, and, owing to the COVID‐19 pandemic, the topic has seen a surge of interest recently. In this paper, we construct optimal group testing designs that consider a heterogeneous population (i.e., with subject‐specific risk), imperfect tests, and while also modeling the dilution effect of grouping (a phenomenon in which the test accuracy of the master sample is affected by the concentration of the virus in the pool), which is often ignored in the literature. We conduct an exhaustive analysis under both a general dilution function and a specific (yet still calibratable) form of the dilution function. Our analytical results of the resulting challenging optimization problems unveil key structural properties that hold in an optimal solution, which we utilize to construct efficient solution schemes. We complement the analysis with two case studies, one on the screening of blood for the Hepatitis B Virus and the other on the screening of subjects for COVID‐19. Our results reveal significant benefits over current practices, individual testing, as well as prior studies that ignore the dilution effect. Such results underscore the importance of incorporating both test and population‐level characteristics into the modeling framework.


  • A quantitative simulation–based modeling approach for college counseling centers

    by Sohom Chatterjee, Youssef Hebaish, Lewis Ntaimo, James Deegear, Miles Rucker, Hrayer Aprahamian

    College counseling centers in various universities have been tasked with the important responsibility of attending to the mental health needs of their students. Owing to the unprecedented recent surge of demand for such services, college counseling centers are facing several crippling resource-level challenges. This is leading to longer wait times which limit access to critical mental health services. To address these challenges, we construct a discrete-event simulation model that captures several intricate details of their operations and provides a data-driven framework to quantify the effect of different policy changes. In contrast to existing work on this matter, which is primarily based on qualitative assessments, the considered quantitative approach has the potential to lead to key observations that can assist counseling directors in constructing a system with desirable performance. To demonstrate the benefit of the considered simulation model, we use data specific to Texas A&M’s Counseling & Psychological Services to run a series of numerical experiments. Our results demonstrate the predictive power of the simulation model, highlight a number of key observations, and identify policy changes that result in desirable system performance.