Mustafa Kemal Tural

According to our database, Mustafa Kemal Tural authored at least 17 papers between 2008 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Energy minimizing order picker forklift routing problem.

Arsham Atashi Khoei, Haldun Süral, Mustafa Kemal Tural

Eur. J. Oper. Res., June, 2023

Finding an energy efficient path for plug-in electric vehicles with speed optimization and travel time restrictions.

Bilgenur Erdogan, Mustafa Kemal Tural, Arsham Atashi Khoei

Comput. Ind. Eng., February, 2023

2020

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

Mustafa Kemal Tural

CoRR, 2020

Multi-facility green Weber problem.

Arsham Atashi Khoei, Haldun Süral, Mustafa Kemal Tural

Comput. Oper. Res., 2020

Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances.

Nazli Dolu, Umur Hastürk, Mustafa Kemal Tural

Comput. Optim. Appl., 2020

k-step betweenness centrality.

Melda Kevser Akgün, Mustafa Kemal Tural

Comput. Math. Organ. Theory, 2020

Centroid based Tree-Structured Data Clustering Using Vertex/Edge Overlap and Graph Edit Distance.

Derya Dinler, Mustafa Kemal Tural, Nur Evin Özdemirel

Ann. Oper. Res., 2020

2018

Faster computation of successive bounds on the group betweenness centrality.

Derya Dinler, Mustafa Kemal Tural

Networks, 2018

2017

Robust semi-supervised clustering with polyhedral and circular uncertainty.

Derya Dinler, Mustafa Kemal Tural

Neurocomputing, 2017

Time-dependent green Weber problem.

Arsham Atashi Khoei, Haldun Süral, Mustafa Kemal Tural

Comput. Oper. Res., 2017

2016

Maximal matching polytope in trees.

Mustafa Kemal Tural

Optim. Methods Softw., 2016

A minisum location problem with regional demand considering farthest Euclidean distances.

Derya Dinler, Mustafa Kemal Tural

Optim. Methods Softw., 2016

2015

Heuristics for a continuous multi-facility location problem with demand regions.

Derya Dinler, Mustafa Kemal Tural, Cem Iyigun

Comput. Oper. Res., 2015

2010

Basis Reduction and the Complexity of Brand-and-Bound.

Gábor Pataki, Mustafa Kemal Tural, Erick B. Wong

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Topics in basis reduction and integer programming.

Mustafa Kemal Tural

PhD thesis, 2009

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

Gábor Pataki, Mustafa Kemal Tural

CoRR, 2009

2008

Branching proofs of infeasibility in low density subset sum problems

Gábor Pataki, Mustafa Kemal Tural

CoRR, 2008