HAHrayer Aprahamian

Hrayer Aprahamian

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

Hrayer Aprahamian has a total of 26 co-authors. Here are the top co-authors by number of shared publications:


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.


  • Optimal System Adjustment Under Operational Constraints with Applications to Infectious Disease Screening

    by Marwan Shams Eddin, Hadi El-Amine, Hrayer Aprahamian

    We propose an optimization framework to solve problems that involve parameters that are forecast to vary over a given time horizon. We model uncertainty in the forecast through the use of lower and upper bounds that can be seen as time-dependent uncertainty levels. Our framework is applicable in long-term budget planning or resource allocation settings. We propose a model to minimize the maximum deviation from a so-called “ideal function” that we then show can be reformulated as a narrowest path problem on an acyclic directed graph with weights determined by solving minimax regret problems. Given that constructing the graph might be computationally demanding, we devise an optimal path discovery iterative scheme that computes edge weights on an as-needed basis and that results in ε-optimal solutions in a finite number of steps. We conduct an extensive numerical analysis of the proposed procedure to determine average-case performance. We then apply our proposed framework in two real-life settings: (1) large-scale screening of populations for West Nile Virus and (2) the allocation of resources in blood donation centers. The results from both case studies indicate significant reductions in yearly societal costs. 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.0048 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0048 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .


  • Robust screening in a pandemic

    by Marwan Shams Eddin, Hadi El-Amine, Hrayer Aprahamian


  • 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 Optimal System Adjustment Under Operational Constraints with Applications to Infectious Disease Screening

    by Hadi El-Amine, Marwan Shams Eddin, Hrayer Aprahamian

    We provide a detailed description of how to use our code to generate each of the figures found in the "results" folder of this repository. Additionally, we have included all the data files that are generated by certain code files and required by others (e.g., plotting scripts in the "scripts" folder). These files may also be used for validation purposes.


  • 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.


  • An Optimization-Based Order-and-Cut Approach for Fair Clustering of Data Sets

    by Su Li, Hrayer Aprahamian, Maher Nouiehed, Hadi El-Amine

    Machine learning algorithms have been increasingly integrated into applications that significantly affect human lives. This surged an interest in designing algorithms that train machine learning models to minimize training error and imposing a certain level of fairness. In this paper, we consider the problem of fair clustering of data sets. In particular, given a set of items each associated with a vector of nonsensitive attribute values and a categorical sensitive attribute (e.g., gender, race, etc.), our goal is to find a clustering of the items that minimizes the loss (i.e., clustering objective) function and imposes fairness measured by Rényi correlation. We propose an efficient and scalable in-processing algorithm, driven by findings from the field of combinatorial optimization, that heuristically solves the underlying optimization problem and allows for regulating the trade-off between clustering quality and fairness. The approach does not restrict the analysis to a specific loss function, but instead considers a more general form that satisfies certain desirable properties. This broadens the scope of the algorithm’s applicability. We demonstrate the effectiveness of the algorithm for the specific case of k-means clustering as it is one of the most extensively studied and widely adopted clustering schemes. Our numerical experiments reveal the proposed algorithm significantly outperforms existing methods by providing a more effective mechanism to regulate the trade-off between loss and fairness. History: Rema Padman served as the senior editor for this article. Data Ethics & Reproducibility Note: The code capsule is available on Code Ocean at https://doi.org/10.24433/CO.9556728.v1 and in the e-Companion to this article (available at https://doi.org/10.1287/ijds.2022.0005 ).

  • An optimization framework for large-scale screening under limited testing capacity with application to COVID-19

    by Jiayi Lin, Hrayer Aprahamian, George Golovko

    We consider the problem of targeted mass screening of heterogeneous populations under limited testing capacity. Mass screening is an essential tool that arises in various settings, e.g., ensuring a safe supply of blood, reducing prevalence of sexually transmitted diseases, and mitigating the spread of infectious disease outbreaks. The goal of mass screening is to classify whole population groups as positive or negative for an infectious disease as efficiently and accurately as possible. Under limited testing capacity, it is not possible to screen the entire population and hence administrators must reserve testing and target those among the population that are most in need or most susceptible. This paper addresses this decision problem by taking advantage of accessible population-level risk information to identify the optimal set of sub-populations to target for screening. We conduct a comprehensive analysis that considers the two most commonly adopted schemes: Individual testing and Dorfman group testing. For both schemes, we formulate an optimization model that aims to minimize the number of misclassifications under a testing capacity constraint. By analyzing the formulations, we establish key structural properties which we use to construct efficient and accurate solution techniques. We conduct a case study on COVID-19 in the United States using geographic-based data. Our results reveal that the considered proactive targeted schemes outperform commonly adopted practices by substantially reducing misclassifications. Our case study provides important managerial insights with regards to optimal allocation of tests, testing designs, and protocols that dictate the optimality of schemes. Such insights can inform policy-makers with tailored and implementable data-driven recommendations.