Behrooz Alizadeh

Orcid: 0000-0001-5726-2843

According to our database1, Behrooz Alizadeh authored at least 36 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
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., February, 2024

A hybrid modified PSO algorithm for the inverse p-median location problem in fuzzy random environment.
Theor. Comput. Sci., 2024

2023
Optimal algorithms for integer inverse obnoxious p-median location problems on tree networks.
Comput. Appl. Math., October, 2023

2022
A modified directional bat algorithm for extensive inverse p-facility maxian location problems on networks.
Soft Comput., 2022

Optimal algorithms for some inverse uncapacitated facility location problems on networks.
Optim. Methods Softw., 2022

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., 2022

2021
The cardinality constrained inverse center location problems on tree networks with edge length augmentation.
Theor. Comput. Sci., 2021

Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks.
Asia Pac. J. Oper. Res., 2021

2020
The mean chance conditional value at risk under interval type-2 intuitionistic fuzzy random environment.
Soft Comput., 2020

The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion.
Inf. Sci., 2020

Solving generalised intuitionistic fuzzy 1-median problem on tree networks with a new ranking method.
Int. J. Math. Oper. Res., 2020

An analytical approach to optimal control of nonlinear systems with input constraints.
Int. J. Autom. Control., 2020

Load balancing, multipath routing and adaptive modulation with traffic grooming in elastic optical networks.
Comput. Networks, 2020

Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks.
Ann. Oper. Res., 2020

Budget-constrained inverse median facility location problem on tree networks.
Appl. Math. Comput., 2020

2019
Inverse obnoxious <i>p</i>-median location problems on trees with edge length modifications under different norms.
Theor. Comput. Sci., 2019

Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective.
Soft Comput., 2019

Switching adaptable optimization of resource allocation for space division multiplexed elastic optical networks.
Opt. Switch. Netw., 2019

Optimal algorithms for selective variants of the classical and inverse median location problems on trees.
Optim. Methods Softw., 2019

2018
Optimal algorithms for inverse vertex obnoxious center location problems on graphs.
Theor. Comput. Sci., 2018

Reverse selective obnoxious center location problems on tree graphs.
Math. Methods Oper. Res., 2018

Combinatorial Algorithms for Some Variants of Inverse Obnoxious Median Location Problem on Tree Networks.
J. Optim. Theory Appl., 2018

Adaptive Modulation and Flexible Resource Allocation in Space-Division-Multiplexed Elastic Optical Networks.
JOCN, 2018

PLI-Aware Cost Management for Green Backbone All-Optical WDM Networks via Dynamic Topology Optimization.
JOCN, 2018

Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems.
Asia Pac. J. Oper. Res., 2018

The Minimum Cost Flow Problem of Uncertain Random Network.
Asia Pac. J. Oper. Res., 2018

Network Planning Optimization for Joint Switching in Spectrally-Spatially Flexible Optical Networks.
Proceedings of the 9th International Symposium on Telecommunications, 2018

2017
Online bandwidth provisioning in all optical interconnection networks of data centers: Throughput maximizing approach.
Comput. Electr. Eng., 2017

2015
QoS aware green routing and wavelength assignment in core WDM networks.
J. Netw. Comput. Appl., 2015

2013
Binary quadratic programming formulation for routing and wavelength assignment problem in all-optical WDM networks.
Opt. Switch. Netw., 2013

A linear time algorithm for inverse obnoxious center location problems on networks.
Central Eur. J. Oper. Res., 2013

2011
Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees.
Networks, 2011

Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees.
Discret. Appl. Math., 2011

2010
Inverse center location problems.
Electron. Notes Discret. Math., 2010

Inverse median location problems with variable coordinates.
Central Eur. J. Oper. Res., 2010

2009
Inverse 1-center location problems with edge length augmentation on trees.
Computing, 2009


  Loading...