Mustafa Kemal Tural

18 papers A* 1Journal 16
YearRankTypeTitle / Venue / Authors
2025 J jnl
Energy-constrained orienteering problem for green tourist trip design: Mathematical formulation and heuristic solution approaches.
Comput. Ind. Eng.
Tolga Karabas, Mustafa Kemal Tural
2023 J jnl
Energy minimizing order picker forklift routing problem.
Eur. J. Oper. Res.
Arsham Atashi Khoei, Haldun Süral, Mustafa Kemal Tural
2023 J jnl
Finding an energy efficient path for plug-in electric vehicles with speed optimization and travel time restrictions.
Comput. Ind. Eng.
Bilgenur Erdogan, Mustafa Kemal Tural, Arsham Atashi Khoei
2020 J jnl
Centroid based Tree-Structured Data Clustering Using Vertex/Edge Overlap and Graph Edit Distance.
Ann. Oper. Res.
Derya Dinler, Mustafa Kemal Tural, Nur Evin Özdemirel
2020 J jnl
Multi-facility green Weber problem.
Comput. Oper. Res.
Arsham Atashi Khoei, Haldun Süral, Mustafa Kemal Tural
2020 J jnl
On the Hardness of Almost All Subset Sum Problems by Ordinary Branch-and-Bound.
CoRR
Mustafa Kemal Tural
2020 J jnl
Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances.
Comput. Optim. Appl.
Nazli Dolu, Umur Hastürk, Mustafa Kemal Tural
2020 J jnl
k-step betweenness centrality.
Comput. Math. Organ. Theory
Melda Kevser Akgün, Mustafa Kemal Tural
2018 J jnl
Faster computation of successive bounds on the group betweenness centrality.
Networks
Derya Dinler, Mustafa Kemal Tural
2017 J jnl
Robust semi-supervised clustering with polyhedral and circular uncertainty.
Neurocomputing
Derya Dinler, Mustafa Kemal Tural
2017 J jnl
Time-dependent green Weber problem.
Comput. Oper. Res.
Arsham Atashi Khoei, Haldun Süral, Mustafa Kemal Tural
2016 J jnl
A minisum location problem with regional demand considering farthest Euclidean distances.
Optim. Methods Softw.
Derya Dinler, Mustafa Kemal Tural
2016 J jnl
Maximal matching polytope in trees.
Optim. Methods Softw.
Mustafa Kemal Tural
2015 J jnl
Heuristics for a continuous multi-facility location problem with demand regions.
Comput. Oper. Res.
Derya Dinler, Mustafa Kemal Tural, Cem Iyigun
2010 A* conf
Basis Reduction and the Complexity of Brand-and-Bound.
SODA
Gábor Pataki, Mustafa Kemal Tural, Erick B. Wong
2009 J jnl
Basis Reduction, and the Complexity of Branch-and-Bound
CoRR
Gábor Pataki, Mustafa Kemal Tural
2009 — —
Topics in basis reduction and integer programming.
Mustafa Kemal Tural
2008 J jnl
Branching proofs of infeasibility in low density subset sum problems
CoRR
Gábor Pataki, Mustafa Kemal Tural