Mustafa Kemal Tural

Orcid: 0000-0002-7173-7646

According to our database1, Mustafa Kemal Tural authored at least 18 papers between 2008 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Energy-constrained orienteering problem for green tourist trip design: Mathematical formulation and heuristic solution approaches.
Comput. Ind. Eng., 2025

2023
Energy minimizing order picker forklift routing problem.
Eur. J. Oper. Res., June, 2023

Finding an energy efficient path for plug-in electric vehicles with speed optimization and travel time restrictions.
Comput. Ind. Eng., February, 2023

2020
On the Hardness of Almost All Subset Sum Problems by Ordinary Branch-and-Bound.
CoRR, 2020

Multi-facility green Weber problem.
Comput. Oper. Res., 2020

Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances.
Comput. Optim. Appl., 2020

k-step betweenness centrality.
Comput. Math. Organ. Theory, 2020

Centroid based Tree-Structured Data Clustering Using Vertex/Edge Overlap and Graph Edit Distance.
Ann. Oper. Res., 2020

2018
Faster computation of successive bounds on the group betweenness centrality.
Networks, 2018

2017
Robust semi-supervised clustering with polyhedral and circular uncertainty.
Neurocomputing, 2017

Time-dependent green Weber problem.
Comput. Oper. Res., 2017

2016
Maximal matching polytope in trees.
Optim. Methods Softw., 2016

A minisum location problem with regional demand considering farthest Euclidean distances.
Optim. Methods Softw., 2016

2015
Heuristics for a continuous multi-facility location problem with demand regions.
Comput. Oper. Res., 2015

2010
Basis Reduction and the Complexity of Brand-and-Bound.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Topics in basis reduction and integer programming.
PhD thesis, 2009

Basis Reduction, and the Complexity of Branch-and-Bound
CoRR, 2009

2008
Branching proofs of infeasibility in low density subset sum problems
CoRR, 2008


  Loading...