Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Hongyu Chen
Claudia Calabrese
Rentao Gu
Victor Campos
Jhonathan Pinzon
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
ZAHRA NAJI AZIMI
Author Info
Open Visualization
Name
Affiliation
Papers
ZAHRA NAJI AZIMI
DEIS, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy
12
Collaborators
Citations
PageRank
12
136
7.51
Referers
Referees
References
323
292
165
Search Limit
100
323
Publications (12 rows)
Collaborators (12 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
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
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
An electromagnetism metaheuristic for the unicost set covering problem
28
1.14
2010
A heuristic procedure for the Capacitated m-Ring-Star problem
16
0.81
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
Hybrid heuristics for Examination Timetabling problem
23
0.87
2005
1