Foad Mahdavi Pajouh

22 papers Journal 20
YearRankTypeTitle / Venue / Authors
2025 J jnl
On Interdicting Dense Clusters in a Network.
INFORMS J. Comput.
Haonan Zhong, Foad Mahdavi Pajouh, Sergiy Butenko, Oleg A. Prokopyev
2023 J jnl
On designing networks resilient to clique blockers.
Eur. J. Oper. Res.
Haonan Zhong, Foad Mahdavi Pajouh, Oleg A. Prokopyev
2021 J jnl
Integer Programming Formulations for Minimum Spanning Tree Interdiction.
INFORMS J. Comput.
Ningji Wei, Jose L. Walteros, Foad Mahdavi Pajouh
2020 J jnl
Detecting a most closeness-central clique in complex networks.
Eur. J. Oper. Res.
Farzaneh Nasirian, Foad Mahdavi Pajouh, Balabhaskar Balasundaram
2020 J jnl
Minimum cost edge blocker clique problem.
Ann. Oper. Res.
Foad Mahdavi Pajouh
2019 J jnl
Exact algorithms for the minimum cost vertex blocker clique problem.
Comput. Oper. Res.
Farzaneh Nasirian, Foad Mahdavi Pajouh, Josephine M. Namayanja
2019 J jnl
Exact algorithms for the minimum s-club partitioning problem.
Ann. Oper. Res.
Oleksandra Yezerska, Foad Mahdavi Pajouh, Alexander Veremyev, Sergiy Butenko
2018 J jnl
Finding clique clusters with the highest betweenness centrality.
Eur. J. Oper. Res.
Maciej Rysz, Foad Mahdavi Pajouh, Eduardo L. Pasiliao
2018 J jnl
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights.
Ann. Oper. Res.
Maciej Rysz, Foad Mahdavi Pajouh, Pavlo A. Krokhmal, Eduardo L. Pasiliao
2017 J jnl
Detecting large risk-averse 2-clubs in graphs with random edge failures.
Ann. Oper. Res.
Foad Mahdavi Pajouh, Esmaeel Moradi, Balabhaskar Balasundaram
2017 J jnl
On biconnected and fragile subgraphs of low diameter.
Eur. J. Oper. Res.
Oleksandra Yezerska, Foad Mahdavi Pajouh, Sergiy Butenko
2016 J jnl
On the 2-Club Polytope of Graphs.
Oper. Res.
Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Illya V. Hicks
2016 J jnl
The Minimum Spanning
INFORMS J. Comput.
Juan Ma, Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Vladimir Boginski
2015 J jnl
Minimum edge blocker dominating set problem.
Eur. J. Oper. Res.
Foad Mahdavi Pajouh, Jose L. Walteros, Vladimir Boginski, Eduardo L. Pasiliao
2014 J jnl
A branch-and-bound approach for maximum quasi-cliques.
Ann. Oper. Res.
Foad Mahdavi Pajouh, Zhuqi Miao, Balabhaskar Balasundaram
2014 — ch.
Analysis and Design of Robust Network Clusters with Bounded Diameter.
Examining Robustness and Vulnerability of Networked Systems
Foad Mahdavi Pajouh, Alexander Veremyev, Vladimir Boginski
2014 J jnl
Minimum vertex blocker clique problem.
Networks
Foad Mahdavi Pajouh, Vladimir Boginski, Eduardo L. Pasiliao
2014 — ch.
On Risk-Averse Weighted k-Club Problems.
Examining Robustness and Vulnerability of Networked Systems
Maciej Rysz, Foad Mahdavi Pajouh, Pavlo A. Krokhmal, Eduardo L. Pasiliao
2013 J jnl
A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates.
Interfaces
Foad Mahdavi Pajouh, Dahai Xing, Yingjue Zhou, Sharethram Hariharan, Balabhaskar Balasundaram, Tieming Liu, Ramesh Sharda
2013 J jnl
On characterization of maximal independent sets via quadratic optimization.
J. Heuristics
Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Oleg A. Prokopyev
2012 J jnl
On inclusionwise maximal and maximum cardinality k-clubs in graphs.
Discret. Optim.
Foad Mahdavi Pajouh, Balabhaskar Balasundaram
2010 J jnl
An RFID network design methodology for asset tracking in healthcare.
Decis. Support Syst.
Asil Oztekin, Foad Mahdavi Pajouh, Dursun Delen, Leva K. Swim