An RFID network design methodology for asset tracking in healthcare. - Asil Oztekin; Foad Mahdavi Pajouh; Dursun Delen; Leva K. Swim (Decis. Support Syst., 2010)

On inclusionwise maximal and maximum cardinality k-clubs in graphs. - Foad Mahdavi Pajouh; Balabhaskar Balasundaram (Discret. Optim., 2012)

On characterization of maximal independent sets via quadratic optimization. - Foad Mahdavi Pajouh; Balabhaskar Balasundaram; Oleg A. Prokopyev (J. Heuristics, 2013)

A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates. - Foad Mahdavi Pajouh; Dahai Xing; Yingjue Zhou; Sharethram Hariharan; Balabhaskar Balasundaram; Tieming Liu; Ramesh Sharda (Interfaces, 2013)

A branch-and-bound approach for maximum quasi-cliques. - Foad Mahdavi Pajouh; Zhuqi Miao; Balabhaskar Balasundaram (Ann. Oper. Res., 2014)

Minimum vertex blocker clique problem. - Foad Mahdavi Pajouh; Vladimir Boginski; Eduardo L. Pasiliao (Networks, 2014)

Analysis and Design of Robust Network Clusters with Bounded Diameter. - Foad Mahdavi Pajouh; Alexander Veremyev; Vladimir Boginski (Examining Robustness and Vulnerability of Networked Systems, 2014)

On Risk-Averse Weighted k-Club Problems. - Maciej Rysz; Foad Mahdavi Pajouh; Pavlo A. Krokhmal; Eduardo L. Pasiliao (Examining Robustness and Vulnerability of Networked Systems, 2014)

Minimum edge blocker dominating set problem. - Foad Mahdavi Pajouh; Jose L. Walteros; Vladimir Boginski; Eduardo L. Pasiliao (Eur. J. Oper. Res., 2015)

The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures. - Juan Ma; Foad Mahdavi Pajouh; Balabhaskar Balasundaram; Vladimir Boginski (INFORMS J. Comput., 2016)

On the 2-Club Polytope of Graphs. - Foad Mahdavi Pajouh; Balabhaskar Balasundaram; Illya V. Hicks (Oper. Res., 2016)

Detecting large risk-averse 2-clubs in graphs with random edge failures. - Foad Mahdavi Pajouh; Esmaeel Moradi; Balabhaskar Balasundaram (Ann. Oper. Res., 2017)

On biconnected and fragile subgraphs of low diameter. - Oleksandra Yezerska; Foad Mahdavi Pajouh; Sergiy Butenko (Eur. J. Oper. Res., 2017)

Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights. - Maciej Rysz; Foad Mahdavi Pajouh; Pavlo A. Krokhmal; Eduardo L. Pasiliao (Ann. Oper. Res., 2018)

Finding clique clusters with the highest betweenness centrality. - Maciej Rysz; Foad Mahdavi Pajouh; Eduardo L. Pasiliao (Eur. J. Oper. Res., 2018)

Exact algorithms for the minimum s-club partitioning problem. - Oleksandra Yezerska; Foad Mahdavi Pajouh; Alexander Veremyev; Sergiy Butenko (Ann. Oper. Res., 2019)

Exact algorithms for the minimum cost vertex blocker clique problem. - Farzaneh Nasirian; Foad Mahdavi Pajouh; Josephine M. Namayanja (Comput. Oper. Res., 2019)

Minimum cost edge blocker clique problem. - Foad Mahdavi Pajouh (Ann. Oper. Res., 2020)

Detecting a most closeness-central clique in complex networks. - Farzaneh Nasirian; Foad Mahdavi Pajouh; Balabhaskar Balasundaram (Eur. J. Oper. Res., 2020)

Integer Programming Formulations for Minimum Spanning Tree Interdiction. - Ningji Wei; Jose L. Walteros; Foad Mahdavi Pajouh (INFORMS J. Comput., 2021)

On designing networks resilient to clique blockers. - Haonan Zhong; Foad Mahdavi Pajouh; Oleg A. Prokopyev (Eur. J. Oper. Res., 2023)