M. Hakan Akyüz

According to our database, M. Hakan Akyüz authored at least 15 papers between 2012 and 2024.

Collaborative distances:

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

2024

Stop Auditing and Start to CARE: Paradigm Shift in Assessing and Improving Supplier Sustainability.

Tarkan Tan, M. Hakan Akyüz, Bengisu Urlu, Santiago Ruiz

INFORMS J. Appl. Anal., 2024

2023

Maximum weight perfect matching problem with additional disjunctive conflict constraints.

M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan

Networks, June, 2023

Solving a minisum single facility location problem in three regions with different norms.

Gökhan Altay, M. Hakan Akyüz, Temel Öncan

Ann. Oper. Res., February, 2023

2022

Minimum cost delivery of multi-item orders in e-commerce logistics.

M. Hakan Akyüz, Ibrahim Muter, Günes Erdogan, Gilbert Laporte

Comput. Oper. Res., 2022

2021

Learning with Subset Stacking.

S. Ilker Birbil, Sinan Yildirim, Kaya Gokalp, M. Hakan Akyüz

CoRR, 2021

Discovering Classification Rules for Interpretable Learning with Linear Programming.

M. Hakan Akyüz, S. Ilker Birbil

CoRR, 2021

2019

Assignment problem with conflicts.

Temel Öncan, Zeynep Suvak, M. Hakan Akyüz, I. Kuban Altinel

Comput. Oper. Res., 2019

Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem.

M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel

Ann. Oper. Res., 2019

A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs.

Temel Öncan, M. Hakan Akyüz, I. Kuban Altinel

Proceedings of the 9th International Network Optimization Conference, 2019

2017

The capacitated multi-facility weber problem with polyhedral barriers: Efficient heuristic methods.

M. Hakan Akyüz

Comput. Ind. Eng., 2017

2015

A Tabu Search Based Heuristic Approach for the Dynamic Container Relocation Problem.

Osman Karpuzoglu, M. Hakan Akyüz, Temel Öncan

Proceedings of the Operations Research Proceedings 2015, 2015

2014

Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem.

M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan

Ann. Oper. Res., 2014

2013

Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems.

M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel

Comput. Oper. Res., 2013

2012

Solving the multi-commodity capacitated multi-facility Weber problem using Lagrangean relaxation and a subgradient-like algorithm.

M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel

J. Oper. Res. Soc., 2012

Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem.

M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel

Comput. Oper. Res., 2012