Foad Mahdavi Pajouh

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 13

Top Topics

Undirected Graph

Top Venues

Ann. Oper. Res.

Eur. J. Oper. Res.

INFORMS J. Comput.

Publications

Haonan Zhong, Foad Mahdavi Pajouh, Oleg A. Prokopyev
On designing networks resilient to clique blockers. Eur. J. Oper. Res. 307 (1) (2023)
Ningji Wei, Jose L. Walteros, Foad Mahdavi Pajouh
Integer Programming Formulations for Minimum Spanning Tree Interdiction. INFORMS J. Comput. 33 (4) (2021)
Farzaneh Nasirian, Foad Mahdavi Pajouh, Balabhaskar Balasundaram
Detecting a most closeness-central clique in complex networks. Eur. J. Oper. Res. 283 (2) (2020)
Foad Mahdavi Pajouh
Minimum cost edge blocker clique problem. Ann. Oper. Res. 294 (1) (2020)
Oleksandra Yezerska, Foad Mahdavi Pajouh, Alexander Veremyev, Sergiy Butenko
Exact algorithms for the minimum s-club partitioning problem. Ann. Oper. Res. 276 (1-2) (2019)
Farzaneh Nasirian, Foad Mahdavi Pajouh, Josephine M. Namayanja
Exact algorithms for the minimum cost vertex blocker clique problem. Comput. Oper. Res. 103 (2019)
Maciej Rysz, Foad Mahdavi Pajouh, Pavlo A. Krokhmal, Eduardo L. Pasiliao
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights. Ann. Oper. Res. 262 (1) (2018)
Maciej Rysz, Foad Mahdavi Pajouh, Eduardo L. Pasiliao
Finding clique clusters with the highest betweenness centrality. Eur. J. Oper. Res. 271 (1) (2018)
Foad Mahdavi Pajouh, Esmaeel Moradi, Balabhaskar Balasundaram
Detecting large risk-averse 2-clubs in graphs with random edge failures. Ann. Oper. Res. 249 (1-2) (2017)
Oleksandra Yezerska, Foad Mahdavi Pajouh, Sergiy Butenko
On biconnected and fragile subgraphs of low diameter. Eur. J. Oper. Res. 263 (2) (2017)
Juan Ma, Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Vladimir Boginski
-Core Problem with Bounded CVaR Under Probabilistic Edge Failures. INFORMS J. Comput. 28 (2) (2016)
Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Illya V. Hicks
On the 2-Club Polytope of Graphs. Oper. Res. 64 (6) (2016)
Foad Mahdavi Pajouh, Jose L. Walteros, Vladimir Boginski, Eduardo L. Pasiliao
Minimum edge blocker dominating set problem. Eur. J. Oper. Res. 247 (1) (2015)
Foad Mahdavi Pajouh, Vladimir Boginski, Eduardo L. Pasiliao
Minimum vertex blocker clique problem. Networks 64 (1) (2014)
Foad Mahdavi Pajouh, Zhuqi Miao, Balabhaskar Balasundaram
A branch-and-bound approach for maximum quasi-cliques. Ann. Oper. Res. 216 (1) (2014)
Foad Mahdavi Pajouh, Dahai Xing, Yingjue Zhou, Sharethram Hariharan, Balabhaskar Balasundaram, Tieming Liu, Ramesh Sharda
A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates. Interfaces 43 (6) (2013)
Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Oleg A. Prokopyev
On characterization of maximal independent sets via quadratic optimization. J. Heuristics 19 (4) (2013)
Foad Mahdavi Pajouh, Balabhaskar Balasundaram
On inclusionwise maximal and maximum cardinality k-clubs in graphs. Discret. Optim. 9 (2) (2012)
Asil Oztekin, Foad Mahdavi Pajouh, Dursun Delen, Leva K. Swim
An RFID network design methodology for asset tracking in healthcare. Decis. Support Syst. 49 (1) (2010)