Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Claudia Calabrese
ana alice baptista
Yujin Yun
Jhonathan Pinzon
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
jun he
Home
/
Author
/
MAJID SALARI
Author Info
Open Visualization
Name
Affiliation
Papers
MAJID SALARI
DEIS, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy
20
Collaborators
Citations
PageRank
28
152
10.08
Referers
Referees
References
306
466
293
Search Limit
100
466
Publications (20 rows)
Collaborators (28 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities
0
0.34
2020
Solution of minimum spanning forest problems with reliability constraints
0
0.34
2020
Limited-stop bus service: A strategy to reduce the unused capacity of a transit network.
0
0.34
2019
Time-constrained maximal covering routing problem
1
0.36
2019
Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network.
0
0.34
2019
The open vehicle routing problem with decoupling points.
2
0.37
2018
Sample average approximation method for a new stochastic personnel assignment problem.
2
0.41
2017
A practical vehicle routing problem with desynchronized arrivals to depot.
2
0.41
2016
Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem
12
0.65
2015
A bi-level programming model for protection of hierarchical facilities under imminent attacks
12
0.53
2015
A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem.
16
0.58
2015
The generalized covering traveling salesman problem.
4
0.41
2014
An integer programming-based local search for the covering salesman problem
20
0.80
2012
An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem.
11
0.59
2012
A covering tour approach to the location of satellite distribution centers to supply humanitarian aid.
6
0.45
2012
The Generalized Covering Salesman Problem
20
0.85
2012
A heuristic procedure for the Capacitated m-Ring-Star problem
16
0.81
2010
An ILP improvement procedure for the Open Vehicle Routing Problem
24
0.74
2010
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization
0
0.34
2010
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
4
0.43
2010
1