Esmaeil Afrashteh

According to our database, Esmaeil Afrashteh authored at least 9 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2023

Optimal algorithms for integer inverse obnoxious p-median location problems on tree networks.

Sepideh Mohammadi, Behrooz Alizadeh, Esmaeil Afrashteh

Comput. Appl. Math., October, 2023

2022

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

Sepideh Mohammadi, Behrooz Alizadeh, Fahimeh Baroughi, Esmaeil Afrashteh

Soft Comput., 2022

2021

Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks.

Mehran Hasanzadeh, Behrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi

Asia Pac. J. Oper. Res., 2021

2020

Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks.

Esmaeil Afrashteh, Behrooz Alizadeh, Fahimeh Baroughi Bonab

Ann. Oper. Res., 2020

Budget-constrained inverse median facility location problem on tree networks.

Behrooz Alizadeh, Esmaeil Afrashteh

Appl. Math. Comput., 2020

2019

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

Behrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi Bonab

Theor. Comput. Sci., 2019

Optimal algorithms for selective variants of the classical and inverse median location problems on trees.

Esmaeil Afrashteh, Behrooz Alizadeh, Fahimeh Baroughi Bonab

Optim. Methods Softw., 2019

2018

Combinatorial Algorithms for Some Variants of Inverse Obnoxious Median Location Problem on Tree Networks.

Behrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi Bonab

J. Optim. Theory Appl., 2018

Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems.

Esmaeil Afrashteh, Behrooz Alizadeh, Fahimeh Baroughi Bonab, Kien Trung Nguyen

Asia Pac. J. Oper. Res., 2018