default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMajid Salari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Reza Rahmati
, Hossein Neghabi, Mahdi Bashiri, Majid Salari:
Stochastic green profit-maximizing hub location problem. J. Oper. Res. Soc. 75(1): 99-121 (2024)- [j26]Reza Atefi, Manuel Iori, Majid Salari, Dario Vezzali:
Solution of a practical vehicle routing problem for monitoring water distribution networks. J. Oper. Res. Soc. 75(10): 1989-2007 (2024) - [j25]Leyla Fazli, Majid Salari, Hossein Neghabi:
A location-inventory-distribution model under gradual injection of pre-disaster budgets with application in disaster relief logistics: a case study. Soft Comput. 28(3): 2125-2159 (2024) - 2023
- [j24]Motahhareh Safdari Shadlou, Mohammad Ranjbar, Majid Salari:
A logic-based Benders decomposition algorithm for a repair crew routing and drone scheduling problem after a natural disaster. Comput. Ind. Eng. 183: 109542 (2023) - 2022
- [i1]Reza Atefi, Manuel Iori, Majid Salari, Dario Vezzali:
A Practical Vehicle Routing Problem for Monitoring Water Distribution Networks. CoRR abs/2202.02549 (2022) - 2021
- [j23]Meisam Omrani, Zahra Naji Azimi, Alireza Pooya, Majid Salari:
Optimal location of electronic charity boxes in charity NGOs by proposing a combined mathematical model. RAIRO Oper. Res. 55(3): 1523-1540 (2021) - 2020
- [j22]Ida Kalateh Ahani, Majid Salari, Seyed Mahmoud Hosseini, Manuel Iori:
Solution of minimum spanning forest problems with reliability constraints. Comput. Ind. Eng. 142: 106365 (2020) - [j21]Asefe Forghani, Farzad Dehghanian, Majid Salari, Yousef Ghiami:
A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities. Comput. Oper. Res. 114 (2020)
2010 – 2019
- 2019
- [j20]Mozhde Bagheri Hosseini, Farzad Dehghanian, Majid Salari:
Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network. Eur. J. Oper. Res. 272(2): 655-673 (2019) - [j19]Afsaneh Amiri, Majid Salari:
Time-constrained maximal covering routing problem. OR Spectr. 41(2): 415-468 (2019) - [j18]Mahdi Torabi, Majid Salari:
Limited-stop bus service: A strategy to reduce the unused capacity of a transit network. Swarm Evol. Comput. 44: 972-986 (2019) - 2018
- [j17]Reza Atefi, Majid Salari, Leandro C. Coelho, Jacques Renaud:
The open vehicle routing problem with decoupling points. Eur. J. Oper. Res. 265(1): 316-327 (2018) - 2017
- [j16]Amir Ghorbani Pour, Zahra Naji Azimi, Majid Salari:
Sample average approximation method for a new stochastic personnel assignment problem. Comput. Ind. Eng. 113: 135-143 (2017) - 2016
- [j15]Zahra Naji Azimi, Majid Salari, Jacques Renaud, Angel B. Ruiz:
A practical vehicle routing problem with desynchronized arrivals to depot. Eur. J. Oper. Res. 255(1): 58-67 (2016) - 2015
- [j14]Majid Salari, Mohammad Reihaneh, Mohammad S. Sabbagh:
Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem. Comput. Ind. Eng. 83: 244-251 (2015) - [j13]Nasrin Aliakbarian, Farzad Dehghanian, Majid Salari:
A bi-level programming model for protection of hierarchical facilities under imminent attacks. Comput. Oper. Res. 64: 210-224 (2015) - [j12]Mojtaba Talebian Sharif, Majid Salari:
A GRASP algorithm for a humanitarian relief transportation problem. Eng. Appl. Artif. Intell. 41: 259-269 (2015) - [j11]Somayeh Allahyari, Majid Salari, Daniele Vigo:
A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem. Eur. J. Oper. Res. 242(3): 756-768 (2015) - 2014
- [j10]Mohammad H. Shaelaie, Majid Salari, Zahra Naji Azimi:
The generalized covering traveling salesman problem. Appl. Soft Comput. 24: 867-878 (2014) - [j9]Majid Salari:
An Iterated Local Search for the Budget Constrained Generalized Maximal Covering Location Problem. J. Math. Model. Algorithms Oper. Res. 13(3): 301-313 (2014) - 2012
- [j8]Majid Salari, Zahra Naji Azimi:
An integer programming-based local search for the covering salesman problem. Comput. Oper. Res. 39(11): 2594-2602 (2012) - [j7]Zahra Naji Azimi, Majid Salari, Paolo Toth:
An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem. Eur. J. Oper. Res. 217(1): 17-25 (2012) - [j6]Zahra Naji Azimi, Jacques Renaud, Angel B. Ruiz, Majid Salari:
A covering tour approach to the location of satellite distribution centers to supply humanitarian aid. Eur. J. Oper. Res. 222(3): 596-605 (2012) - [j5]Bruce L. Golden, Zahra Naji Azimi, S. Raghavan, Majid Salari, Paolo Toth:
The Generalized Covering Salesman Problem. INFORMS J. Comput. 24(4): 534-553 (2012) - 2010
- [b1]Majid Salari:
Formulations and Algorithms for Routing Problems. University of Bologna, Italy, 2010 - [j4]Zahra Naji Azimi, Majid Salari, Bruce L. Golden, S. Raghavan, Paolo Toth:
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems. Comput. Oper. Res. 37(11): 1952-1964 (2010) - [j3]Majid Salari, Paolo Toth, Andrea Tramontani:
An ILP improvement procedure for the Open Vehicle Routing Problem. Comput. Oper. Res. 37(12): 2106-2120 (2010) - [j2]Majid Salari, Zahra Naji Azimi, Paolo Toth:
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization. Electron. Notes Discret. Math. 36: 343-350 (2010) - [j1]Zahra Naji Azimi, Majid Salari, Paolo Toth:
A heuristic procedure for the Capacitated m-Ring-Star problem. Eur. J. Oper. Res. 207(3): 1227-1234 (2010)
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-10-23 20:36 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:
