Majid Salari

Orcid: 0000-0002-8064-7327

According to our database1, Majid Salari authored at least 28 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A location-inventory-distribution model under gradual injection of pre-disaster budgets with application in disaster relief logistics: a case study.
Soft Comput., February, 2024

Stochastic green profit-maximizing hub location problem.
J. Oper. Res. Soc., January, 2024

2023
A logic-based Benders decomposition algorithm for a repair crew routing and drone scheduling problem after a natural disaster.
Comput. Ind. Eng., September, 2023

2022
A Practical Vehicle Routing Problem for Monitoring Water Distribution Networks.
CoRR, 2022

2021
Optimal location of electronic charity boxes in charity NGOs by proposing a combined mathematical model.
RAIRO Oper. Res., 2021

2020
A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities.
Comput. Oper. Res., 2020

Solution of minimum spanning forest problems with reliability constraints.
Comput. Ind. Eng., 2020

2019
Limited-stop bus service: A strategy to reduce the unused capacity of a transit network.
Swarm Evol. Comput., 2019

Time-constrained maximal covering routing problem.
OR Spectr., 2019

Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network.
Eur. J. Oper. Res., 2019

2018
The open vehicle routing problem with decoupling points.
Eur. J. Oper. Res., 2018

2017
Sample average approximation method for a new stochastic personnel assignment problem.
Comput. Ind. Eng., 2017

2016
A practical vehicle routing problem with desynchronized arrivals to depot.
Eur. J. Oper. Res., 2016

2015
A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem.
Eur. J. Oper. Res., 2015

A GRASP algorithm for a humanitarian relief transportation problem.
Eng. Appl. Artif. Intell., 2015

A bi-level programming model for protection of hierarchical facilities under imminent attacks.
Comput. Oper. Res., 2015

Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem.
Comput. Ind. Eng., 2015

2014
An Iterated Local Search for the Budget Constrained Generalized Maximal Covering Location Problem.
J. Math. Model. Algorithms Oper. Res., 2014

The generalized covering traveling salesman problem.
Appl. Soft Comput., 2014

2012
The Generalized Covering Salesman Problem.
INFORMS J. Comput., 2012

An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem.
Eur. J. Oper. Res., 2012

A covering tour approach to the location of satellite distribution centers to supply humanitarian aid.
Eur. J. Oper. Res., 2012

An integer programming-based local search for the covering salesman problem.
Comput. Oper. Res., 2012

2010
Formulations and Algorithms for Routing Problems.
PhD thesis, 2010

A heuristic procedure for the Capacitated m-Ring-Star problem.
Eur. J. Oper. Res., 2010

A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization.
Electron. Notes Discret. Math., 2010

An ILP improvement procedure for the Open Vehicle Routing Problem.
Comput. Oper. Res., 2010

Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems.
Comput. Oper. Res., 2010


  Loading...