default search action
Jafar Fathali
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j19]Tahere Sayar, Mojtaba Ghiyasi, Jafar Fathali:
Inverse revenue and cost efficiency with budget and revenue constraints: applying hospital revenue and budget planning models. Int. J. Math. Oper. Res. 25(4): 511-526 (2023) - [j18]Abolfazl Poureidi
, Jafar Fathali:
Algorithmic results in Roman dominating functions on graphs. Inf. Process. Lett. 182: 106363 (2023) - [j17]Jafar Fathali
The balanced 2-median and 2-maxian problems on a tree. J. Comb. Optim. 45(2): 69 (2023) - [j16]Azam Azodi, Jafar Fathali
Fuzzy balanced allocation problem with efficiency on facilities. Soft Comput. 27(10): 6573-6586 (2023) - 2022
- [j15]Jafar Fathali:
A row generation method for the inverse continuous facility location problems. Comput. Ind. Eng. 171: 108482 (2022) - 2021
- [j14]Abolfazl Poureidi
Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination. J. Comb. Optim. 41(2): 304-317 (2021) - [j13]Tahere Sayar, Mojtaba Ghiyasi
New inverse DEA models for budgeting and planning. RAIRO Oper. Res. 55(3): 1933-1948 (2021)
2010 – 2019
- 2019
- [j12]Mehrdad Moshtagh, Jafar Fathali
Finding an optimal core on a tree network with M/G/c/c state-dependent queues. Math. Methods Oper. Res. 89(1): 115-142 (2019) - 2018
- [j11]Mehrdad Moshtagh, Jafar Fathali
The Stochastic Queue Core problem, evacuation networks, and state-dependent queues. Eur. J. Oper. Res. 269(2): 730-748 (2018) - [i1]Jafar Fathali, Mehdi Zaferanieh:
The balanced 2-median and 2-maxian problems on a tree. CoRR abs/1803.10332 (2018) - 2017
- [j10]Mehdi Golpayegani, Jafar Fathali
A particle swarm optimization method for semi-obnoxious line location problem with rectilinear norm. Comput. Ind. Eng. 109: 71-78 (2017) - 2016
- [j9]Fatemeh Taleshian, Jafar Fathali
A Mathematical Model for Fuzzy p-Median Problem with Fuzzy Weights and Variables. Adv. Oper. Res. 2016: 7590492:1-7590492:13 (2016) - 2014
- [j8]Mehdi Golpayegani, Jafar Fathali
Median line location problem with positive and negative weights and Euclidean norm. Neural Comput. Appl. 24(3-4): 613-619 (2014) - 2012
- [j7]Mehdi Zaferanieh
Finding a core of a tree with pos/neg weight. Math. Methods Oper. Res. 76(2): 147-160 (2012)
2000 – 2009
- 2009
- [j6]Jafar Fathali
A BSSS Algorithm for the Location Problem with Minimum Square Error. Adv. Oper. Res. 2009: 212040:1-212040:10 (2009) - 2007
- [j5]Rainer E. Burkard, Jafar Fathali
A polynomial method for the pos/neg weighted 3-median problem on a tree. Math. Methods Oper. Res. 65(2): 229-238 (2007) - [j4]Rainer E. Burkard, Jafar Fathali
The p-maxian problem on a tree. Oper. Res. Lett. 35(3): 331-335 (2007) - 2006
- [j3]Jafar Fathali
A genetic algorithm for the p-median problem with pos/neg weights. Appl. Math. Comput. 183(2): 1071-1083 (2006) - [j2]Jafar Fathali
An ant colony algorithm for the pos/neg weighted p-median problem. Central Eur. J. Oper. Res. 14(3): 229-246 (2006) - [j1]Jafar Fathali
Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases. Eur. J. Oper. Res. 170(2): 440-462 (2006)
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-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: