Остановите войну!
for scientists:
default search action
Foad Mahdavi Pajouh
Person information
- affiliation: University of Massachusetts, Boston, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j19]Haonan Zhong, Foad Mahdavi Pajouh, Oleg A. Prokopyev:
On designing networks resilient to clique blockers. Eur. J. Oper. Res. 307(1): 20-32 (2023) - 2021
- [j18]Ningji Wei, Jose L. Walteros, Foad Mahdavi Pajouh:
Integer Programming Formulations for Minimum Spanning Tree Interdiction. INFORMS J. Comput. 33(4): 1461-1480 (2021) - 2020
- [j17]Foad Mahdavi Pajouh:
Minimum cost edge blocker clique problem. Ann. Oper. Res. 294(1): 345-376 (2020) - [j16]Farzaneh Nasirian, Foad Mahdavi Pajouh, Balabhaskar Balasundaram:
Detecting a most closeness-central clique in complex networks. Eur. J. Oper. Res. 283(2): 461-475 (2020)
2010 – 2019
- 2019
- [j15]Oleksandra Yezerska, Foad Mahdavi Pajouh, Alexander Veremyev, Sergiy Butenko:
Exact algorithms for the minimum s-club partitioning problem. Ann. Oper. Res. 276(1-2): 267-291 (2019) - [j14]Farzaneh Nasirian, Foad Mahdavi Pajouh, Josephine M. Namayanja:
Exact algorithms for the minimum cost vertex blocker clique problem. Comput. Oper. Res. 103: 296-309 (2019) - 2018
- [j13]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): 89-108 (2018) - [j12]Maciej Rysz, Foad Mahdavi Pajouh, Eduardo L. Pasiliao:
Finding clique clusters with the highest betweenness centrality. Eur. J. Oper. Res. 271(1): 155-164 (2018) - 2017
- [j11]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): 55-73 (2017) - [j10]Oleksandra Yezerska, Foad Mahdavi Pajouh, Sergiy Butenko:
On biconnected and fragile subgraphs of low diameter. Eur. J. Oper. Res. 263(2): 390-400 (2017) - 2016
- [j9]Juan Ma, Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Vladimir Boginski:
The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures. INFORMS J. Comput. 28(2): 295-307 (2016) - [j8]Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Illya V. Hicks:
On the 2-Club Polytope of Graphs. Oper. Res. 64(6): 1466-1481 (2016) - 2015
- [j7]Foad Mahdavi Pajouh, Jose L. Walteros, Vladimir Boginski, Eduardo L. Pasiliao:
Minimum edge blocker dominating set problem. Eur. J. Oper. Res. 247(1): 16-26 (2015) - 2014
- [j6]Foad Mahdavi Pajouh, Zhuqi Miao, Balabhaskar Balasundaram:
A branch-and-bound approach for maximum quasi-cliques. Ann. Oper. Res. 216(1): 145-161 (2014) - [j5]Foad Mahdavi Pajouh, Vladimir Boginski, Eduardo L. Pasiliao:
Minimum vertex blocker clique problem. Networks 64(1): 48-64 (2014) - [p2]Foad Mahdavi Pajouh, Alexander Veremyev, Vladimir Boginski:
Analysis and Design of Robust Network Clusters with Bounded Diameter. Examining Robustness and Vulnerability of Networked Systems 2014: 141-160 - [p1]Maciej Rysz, Foad Mahdavi Pajouh, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
On Risk-Averse Weighted k-Club Problems. Examining Robustness and Vulnerability of Networked Systems 2014: 231-242 - 2013
- [j4]Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Oleg A. Prokopyev:
On characterization of maximal independent sets via quadratic optimization. J. Heuristics 19(4): 629-644 (2013) - [j3]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): 503-517 (2013) - 2012
- [j2]Foad Mahdavi Pajouh, Balabhaskar Balasundaram:
On inclusionwise maximal and maximum cardinality k-clubs in graphs. Discret. Optim. 9(2): 84-97 (2012) - 2010
- [j1]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): 100-109 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint