default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBehrooz Alizadeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Sepideh Taghikhani, Fahimeh Baroughi, Behrooz Alizadeh
:
Mean-variance value at risk criterion for solving a p-median location problem on networks with type-2 intuitionistic fuzzy weights. J. Comput. Appl. Math. 437: 115481 (2024)- [j34]Sepideh Taghikhani, Fahimeh Baroughi, Behrooz Alizadeh:
A hybrid modified PSO algorithm for the inverse p-median location problem in fuzzy random environment. Theor. Comput. Sci. 1000: 114574 (2024) - 2023
- [j33]Sepideh Mohammadi, Behrooz Alizadeh, Esmaeil Afrashteh:
Optimal algorithms for integer inverse obnoxious p-median location problems on tree networks. Comput. Appl. Math. 42(7): 312 (2023) - 2022
- [j32]Sepideh Taghikhani, Fahimeh Baroughi, Behrooz Alizadeh:
A generalized interval type-2 fuzzy random variable based algorithm under mean chance value at risk criterion for inverse 1-median location problems on tree networks with uncertain costs. J. Comput. Appl. Math. 408: 114104 (2022) - [j31]Mehran Hasanzadeh, Behrooz Alizadeh, Fahimeh Baroughi:
Optimal algorithms for some inverse uncapacitated facility location problems on networks. Optim. Methods Softw. 37(3): 982-1005 (2022) - [j30]Sepideh Mohammadi, Behrooz Alizadeh, Fahimeh Baroughi, Esmaeil Afrashteh:
A modified directional bat algorithm for extensive inverse p-facility maxian location problems on networks. Soft Comput. 26(4): 1941-1959 (2022) - 2021
- [j29]Mehran Hasanzadeh, Behrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi:
Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks. Asia Pac. J. Oper. Res. 38(4): 2150001:1-2150001:19 (2021) - [j28]Mehran Hasanzadeh, Behrooz Alizadeh, Fahimeh Baroughi:
The cardinality constrained inverse center location problems on tree networks with edge length augmentation. Theor. Comput. Sci. 865: 12-33 (2021) - 2020
- [j27]Behrooz Alizadeh, Esmaeil Afrashteh:
Budget-constrained inverse median facility location problem on tree networks. Appl. Math. Comput. 375: 125078 (2020) - [j26]Esmaeil Afrashteh, Behrooz Alizadeh, Fahimeh Baroughi Bonab:
Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks. Ann. Oper. Res. 289(2): 153-172 (2020) - [j25]Seyedeh Mina Hosseini Ghazvini, Akbar Ghaffarpour Rahbar, Behrooz Alizadeh:
Load balancing, multipath routing and adaptive modulation with traffic grooming in elastic optical networks. Comput. Networks 169: 107081 (2020) - [j24]Reza Mojed Gharamaleki, Mehdi Mirzaei, Sadra Rafatnia, Behrooz Alizadeh:
An analytical approach to optimal control of nonlinear systems with input constraints. Int. J. Autom. Control. 14(2): 213-238 (2020) - [j23]Akram Soltanpour, Fahimeh Baroughi Bonab, Behrooz Alizadeh:
Solving generalised intuitionistic fuzzy 1-median problem on tree networks with a new ranking method. Int. J. Math. Oper. Res. 17(4): 552-571 (2020) - [j22]Akram Soltanpour, Fahimeh Baroughi Bonab, Behrooz Alizadeh:
The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion. Inf. Sci. 506: 383-394 (2020) - [j21]Sepideh Taghikhani, Fahimeh Baroughi Bonab, Behrooz Alizadeh:
The mean chance conditional value at risk under interval type-2 intuitionistic fuzzy random environment. Soft Comput. 24(13): 9361-9373 (2020)
2010 – 2019
- 2019
- [j20]Esmaeil Afrashteh, Behrooz Alizadeh, Fahimeh Baroughi Bonab:
Optimal algorithms for selective variants of the classical and inverse median location problems on trees. Optim. Methods Softw. 34(6): 1213-1230 (2019) - [j19]Mohsen Yaghubi-Namaad, Akbar Ghaffarpour Rahbar, Behrooz Alizadeh, Amin Ghadesi:
Switching adaptable optimization of resource allocation for space division multiplexed elastic optical networks. Opt. Switch. Netw. 31: 8-21 (2019) - [j18]Akram Soltanpour, Fahimeh Baroughi Bonab, Behrooz Alizadeh:
Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective. Soft Comput. 23(17): 7843-7852 (2019) - [j17]Behrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi Bonab:
Inverse obnoxious p-median location problems on trees with edge length modifications under different norms. Theor. Comput. Sci. 772: 73-87 (2019) - 2018
- [j16]Soheila Abdi, Fahimeh Baroughi Bonab, Behrooz Alizadeh:
The Minimum Cost Flow Problem of Uncertain Random Network. Asia Pac. J. Oper. Res. 35(3): 1850016:1-1850016:18 (2018) - [j15]Esmaeil Afrashteh, Behrooz Alizadeh, Fahimeh Baroughi Bonab, Kien Trung Nguyen:
Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems. Asia Pac. J. Oper. Res. 35(5): 1850030:1-1850030:22 (2018) - [j14]Mohsen Yaghubi-Namaad, Akbar Ghaffarpour Rahbar, Behrooz Alizadeh:
Adaptive Modulation and Flexible Resource Allocation in Space-Division-Multiplexed Elastic Optical Networks. JOCN 10(3): 240-251 (2018) - [j13]Amin Ebrahimzadeh, Akbar Ghaffarpour Rahbar, Behrooz Alizadeh:
PLI-Aware Cost Management for Green Backbone All-Optical WDM Networks via Dynamic Topology Optimization. JOCN 10(9): 785-795 (2018) - [j12]Behrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi Bonab:
Combinatorial Algorithms for Some Variants of Inverse Obnoxious Median Location Problem on Tree Networks. J. Optim. Theory Appl. 178(3): 914-934 (2018) - [j11]Roghayeh Etemad, Behrooz Alizadeh:
Reverse selective obnoxious center location problems on tree graphs. Math. Methods Oper. Res. 87(3): 431-450 (2018) - [j10]Behrooz Alizadeh, Roghayeh Etemad:
Optimal algorithms for inverse vertex obnoxious center location problems on graphs. Theor. Comput. Sci. 707: 36-45 (2018) - [c1]Mohsen Yaghubi-Namaad, Akbar Ghaffar Pour Rahbar, Behrooz Alizadeh:
Network Planning Optimization for Joint Switching in Spectrally-Spatially Flexible Optical Networks. IST 2018: 139-143 - 2017
- [j9]Amin Ebrahimzadeh, Akbar Ghaffarpour Rahbar, Behrooz Alizadeh:
Online bandwidth provisioning in all optical interconnection networks of data centers: Throughput maximizing approach. Comput. Electr. Eng. 57: 15-27 (2017) - 2015
- [j8]Amin Ebrahimzadeh, Akbar Ghaffar Pour Rahbar, Behrooz Alizadeh:
QoS aware green routing and wavelength assignment in core WDM networks. J. Netw. Comput. Appl. 53: 1-13 (2015) - 2013
- [j7]Behrooz Alizadeh, Rainer E. Burkard:
A linear time algorithm for inverse obnoxious center location problems on networks. Central Eur. J. Oper. Res. 21(3): 585-594 (2013) - [j6]Amin Ebrahimzadeh, Akbar Ghaffar Pour Rahbar, Behrooz Alizadeh:
Binary quadratic programming formulation for routing and wavelength assignment problem in all-optical WDM networks. Opt. Switch. Netw. 10(4): 354-365 (2013) - 2011
- [j5]Behrooz Alizadeh, Rainer E. Burkard:
Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees. Discret. Appl. Math. 159(8): 706-716 (2011) - [j4]Behrooz Alizadeh, Rainer E. Burkard:
Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks 58(3): 190-200 (2011) - 2010
- [j3]Fahimeh Baroughi Bonab, Rainer E. Burkard, Behrooz Alizadeh:
Inverse median location problems with variable coordinates. Central Eur. J. Oper. Res. 18(3): 365-381 (2010) - [j2]Rainer E. Burkard, Behrooz Alizadeh:
Inverse center location problems. Electron. Notes Discret. Math. 36: 105-110 (2010)
2000 – 2009
- 2009
- [j1]Behrooz Alizadeh, Rainer E. Burkard, Ulrich Pferschy:
Inverse 1-center location problems with edge length augmentation on trees. Computing 86(4): 331-343 (2009)
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-06-03 00:59 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:
