Morteza Keshtkaran

Orcid: 0000-0001-7238-8209

According to our database1, Morteza Keshtkaran authored at least 6 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Revised eight-step feasibility checking procedure with linear time complexity for the Dial-a-Ride Problem (DARP).
Comput. Oper. Res., 2024

2021
ACS-OPHS: Ant Colony System for the Orienteering Problem with hotel selection.
EURO J. Transp. Logist., 2021

2020
A Greedy Randomized Adaptive Search Procedure for the Orienteering Problem with Hotel Selection.
Eur. J. Oper. Res., 2020

2018
TFI-Apriori: Using new encoding to optimize the apriori algorithm.
Intell. Data Anal., 2018

2016
A novel GRASP solution approach for the Orienteering Problem.
J. Heuristics, 2016

2011
A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011


  Loading...