Salman Khodayifar
Cited by
Cited by
Minimum cost multiple multicast network coding with quantized rates
MA Raayatpanah, HS Fathabadi, BH Khalaj, S Khodayifar
Computer Networks 57 (5), 1113-1123, 2013
Hybridizing particle swarm optimization with simulated annealing and differential evolution
E Mirsadeghi, S Khodayifar
Cluster Computing 24, 1135-1163, 2021
Bounds on end-to-end statistical delay and jitter in multiple multicast coded packet networks
MA Raayatpanah, HS Fathabadi, BH Khalaj, S Khodayifar, PM Pardalos
Journal of Network and Computer Applications 41, 217-227, 2014
Minimum flow problem on network flows with time-varying bounds
HS Fathabadi, S Khodayifar, MA Raayatpanah
Applied Mathematical Modelling 36 (9), 4414-4421, 2012
Copula theory approach to stochastic geometric programming
R Khanjani-Shiraz, S Khodayifar, PM Pardalos
Journal of Global Optimization 81 (2), 435-468, 2021
Demand response management in smart homes using robust optimization
M Mahmoudi, M Afsharchi, S Khodayifar
Electric Power Components and Systems 48 (8), 817-832, 2020
Joint chance constrained shortest path problem with Copula theory
Z Hosseini Nodeh, A Babapour Azar, R Khanjani Shiraz, S Khodayifar, ...
Journal of Combinatorial Optimization, 1-31, 2020
A simple algorithm for reliability evaluation in dynamic networks with stochastic transit times
HS Fathabadi, S Khezri, S Khodayifar
Journal of Industrial and Production Engineering 32 (2), 115-120, 2015
Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
S Khodayifar
Optimization Letters 15, 1009-1026, 2021
Optimal long-term distributed generation planning and reconfiguration of distribution systems: An accelerating Benders’ decomposition approach
S Khodayifar, MA Raayatpanah, A Rabiee, H Rahimian, PM Pardalos
Journal of Optimization Theory and Applications 179, 283-310, 2018
A polynomial time algorithm for big data in a special case of minimum constraint removal problem
B Sadeghi Bigham, F Noorizadeh, S Khodayifar
Evolutionary Intelligence 13 (2), 247-254, 2020
An accelerating Benders’ decomposition approach to the integrated supply chain network design with distributed generation
S Khodayifar, MA Raayatpanah, PM Pardalos
Energy Systems 9, 647-667, 2018
A polynomial time algorithm for the minimum flow problem in time-varying networks
S Khodayifar, MA Raayatpanah, PM Pardalos
Annals of Operations Research 272, 29-39, 2019
A novel approach to subgraph selection with multiple weights on arcs
MA Raayatpanah, S Khodayifar, T Weise, P Pardalos
Journal of Combinatorial Optimization, 1-27, 2022
Evaluating the performance of multiple comparable queuing by using DEA
Y Jafari, R Madahi, S Khodayifar
2nd National Conference on Data Envelopment Analysis, 2010
Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory
S Khezri, S Khodayifar
Computers & Operations Research 156, 106260, 2023
Distributionally Robust Chance-Constrained Multicommodity Network Flow Problem in Time-Varying Networks: By Column-Generation Approach
S Khodayifar, S Khezri, PM Pardalos
Available at SSRN 4485521, 2023
Accelerating Benders’ Approach for the Scheduling of Charging and Discharging of Electric Vehicles in Smart Grids
S Khodayifar, D Babaloo
Journal of Operational Research In Its Applications (Applied Mathematics …, 2020
A New Model for Multi-Robot Path Planning on Graphs with Using Network Flow
SK Biroon, BS Bigham, S Khodayifar
EasyChair, 2019
A possibility programming approach for integrated supply chain
S Khodayifar
on Mathematics and Mathematics Education (ICMME 2019), 123, 2019
The system can't perform the operation now. Try again later.
Articles 1–20