Yajun Lu

Exact Approaches for the Maximum Mortality Rate Clique Problem

  • Parisa Vaghfi Mohebbi
  • Yajun Lu
  • Balabhaskar Balasundaram
    • Categories (Mixed) Integer Linear Programming, Applications - OR and Management Sciences, Branch and Cut Algorithms Tags , , ,

    This paper develops exact solution methods for the maximum mortality rate clique problem, which aims to identify a cluster of diseases in a comorbidity graph associated with the highest mortality rate among patients whose healthcare encounters are recorded in electronic health records. We establish the NP-hardness of the problem and propose two mixed-integer linear programming … Read more

    On fault-tolerant low-diameter clusters in graphs

  • Yajun Lu
  • Hosseinali Salemi
  • Balabhaskar Balasundaram
  • Austin Buchanan
    • Categories 0-1 Programming, Branch and Cut Algorithms, Network Optimization Tags , , , ,

    Cliques and their generalizations are frequently used to model “tightly knit” clusters in graphs and identifying such clusters is a popular technique used in graph-based data mining. One such model is the $s$-club, which is a vertex subset that induces a subgraph of diameter at most $s$. This model has found use in a variety … Read more