Foad Mahdavi Pajouh
Foad Mahdavi Pajouh
Industrial Engineering and Management, PhD
Verified email at - Homepage
Cited by
Cited by
An RFID network design methodology for asset tracking in healthcare
A Oztekin, FM Pajouh, D Delen, LK Swim
Decision Support Systems 49 (1), 100-109, 2010
On inclusionwise maximal and maximum cardinality k-clubs in graphs
F Mahdavi Pajouh, B Balasundaram
Discrete Optimization 9 (2), 84-97, 2012
Minimum vertex blocker clique problem
F Mahdavi Pajouh, V Boginski, EL Pasiliao
Networks 64 (1), 48-64, 2014
A branch-and-bound approach for maximum quasi-cliques
FM Pajouh, Z Miao, B Balasundaram
Annals of Operations Research 216 (1), 145-161, 2014
Criticality index analysis based optimal RFID reader placement models for asset tracking
A Oztekin, F Mahdavi, K Erande, Zhenyu (James) Kong, LK Swim, ...
International journal of production research 48 (9), 2679-2698, 2010
Graph theoretic clique relaxations and applications
B Balasundaram, FM Pajouh
Handbook of Combinatorial Optimization, 1559-1598, 2013
Finding clique clusters with the highest betweenness centrality
M Rysz, FM Pajouh, EL Pasiliao
European Journal of Operational Research 271 (1), 155-164, 2018
Minimum edge blocker dominating set problem
FM Pajouh, JL Walteros, V Boginski, EL Pasiliao
European Journal of Operational Research 247 (1), 16-26, 2015
Detecting a most closeness-central clique in complex networks
F Nasirian, FM Pajouh, B Balasundaram
European Journal of Operational Research 283 (2), 461-475, 2020
On characterization of maximal independent sets via quadratic optimization
FM Pajouh, B Balasundaram, OA Prokopyev
Journal of Heuristics 19 (4), 629-644, 2013
On the 2-Club Polytope of Graphs
FM Pajouh, B Balasundaram, IV Hicks
Operations Research 64 (6), 1466-1481, 2016
Integer programming formulations for minimum spanning tree interdiction
N Wei, JL Walteros, FM Pajouh
INFORMS Journal on Computing 33 (4), 1461-1480, 2021
Finding influential groups in networked systems: The most degree-central clique problem
H Zhong, FM Pajouh, OA Prokopyev
Omega 101, 102262, 2021
The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures
J Ma, FM Pajouh, B Balasundaram, V Boginski
INFORMS Journal on Computing 28 (2), 295-307, 2016
Minimum cost edge blocker clique problem
F Mahdavi Pajouh
Annals of Operations Research 294 (1-2), 345-376, 2020
On biconnected and fragile subgraphs of low diameter
O Yezerska, FM Pajouh, S Butenko
European Journal of Operational Research 263 (2), 390-400, 2017
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
M Rysz, FM Pajouh, P Krokhmal, EL Pasiliao
Annals of Operations Research 262, 89-108, 2018
Applications of queueing models in hospitals
FM Pajouh, M Kamath
Midwest Association for Information (MWAIS) 2010, 2010
Exact algorithms for the minimum cost vertex blocker clique problem
F Nasirian, FM Pajouh, J Namayanja
Computers & Operations Research 103, 296-309, 2019
Detecting large risk-averse 2-clubs in graphs with random edge failures
F Mahdavi Pajouh, E Moradi, B Balasundaram
Annals of operations research 249 (1), 55-73, 2017
The system can't perform the operation now. Try again later.
Articles 1–20