M. Hakan Akyüz

16 papers C 1Journal 14Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Rule generation for classification: Scalability, interpretability, and fairness.
Comput. Oper. Res.
Tabea E. Röber, Adia C. Lumadjeng, M. Hakan Akyüz, S. Ilker Birbil
2024 J jnl
Stop Auditing and Start to CARE: Paradigm Shift in Assessing and Improving Supplier Sustainability.
INFORMS J. Appl. Anal.
Tarkan Tan, M. Hakan Akyüz, Bengisu Urlu, Santiago Ruiz
2023 J jnl
Maximum weight perfect matching problem with additional disjunctive conflict constraints.
Networks
M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan
2023 J jnl
Solving a minisum single facility location problem in three regions with different norms.
Ann. Oper. Res.
Gökhan Altay, M. Hakan Akyüz, Temel Öncan
2022 J jnl
Minimum cost delivery of multi-item orders in e-commerce logistics.
Comput. Oper. Res.
M. Hakan Akyüz, Ibrahim Muter, Günes Erdogan, Gilbert Laporte
2021 J jnl
Discovering Classification Rules for Interpretable Learning with Linear Programming.
CoRR
M. Hakan Akyüz, S. Ilker Birbil
2021 J jnl
Learning with Subset Stacking.
CoRR
S. Ilker Birbil, Sinan Yildirim, Kaya Gokalp, M. Hakan Akyüz
2019 C conf
A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs.
INOC
Temel Öncan, M. Hakan Akyüz, I. Kuban Altinel
2019 J jnl
Assignment problem with conflicts.
Comput. Oper. Res.
Temel Öncan, Zeynep Suvak, M. Hakan Akyüz, I. Kuban Altinel
2019 J jnl
Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem.
Ann. Oper. Res.
M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel
2017 J jnl
The capacitated multi-facility weber problem with polyhedral barriers: Efficient heuristic methods.
Comput. Ind. Eng.
M. Hakan Akyüz
2015 — conf
A Tabu Search Based Heuristic Approach for the Dynamic Container Relocation Problem.
OR
Osman Karpuzoglu, M. Hakan Akyüz, Temel Öncan
2014 J jnl
Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem.
Ann. Oper. Res.
M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan
2013 J jnl
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems.
Comput. Oper. Res.
M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel
2012 J jnl
Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem.
Comput. Oper. Res.
M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel
2012 J jnl
Solving the multi-commodity capacitated multi-facility Weber problem using Lagrangean relaxation and a subgradient-like algorithm.
J. Oper. Res. Soc.
M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel