M.H. (Hakan) Akyüz
M. Hakan Akyüz received his Ph.D. degree in Industrial Engineering from Boğaziçi University. He worked as a post-doctoral fellow at Hong Kong University of Science and Technology between 2012-2013. He joined the Department of Industrial Engineering at Galatasaray University in 2014 as an Assistant Professor and became an Associate Professor in 2018. He is part of the Econometrics Department at Erasmus School of Economics since 2020. His research interest spans logistics, algorithms and machine learning. He aims to integrate optimization and machine learning techniques in decision making with an emphasis on explainability and algorithmic fairness. Dr. Akyüz is also associated with the sector plan SSH Breed on Theme 4 (Digital decision support) at Erasmus University Rotterdam as a member.
Publications
Article (16)
-
Academic (16)
-
Tan, T., Akyüz, MH., Urlu, B., & Ruiz, S. (2023). Stop Auditing and Start to CARE: Paradigm Shift in Assessing and Improving Supplier Sustainability. Journal on Applied Analytics. https://doi.org/10.1287/inte.2022.0015
-
Akyüz, M. H., Altınel, K., & Öncan, T. (2023). Maximum weight perfect matching problem with additional disjunctive conflict constraints. Networks, 81(4), 465-489. https://doi.org/10.1002/net.22139
-
Altay, G., Akyüz, M. H., & Öncan, T. (2023). Solving a minisum single facility location problem in three regions with different norms. Annals of Operations Research, 321(1-2), 1-37. https://doi.org/10.1007/s10479-022-04952-5
-
Akyüz, M. H., Dekker, R., & Sharif Azadeh, S. (2023). Partial and complete replanning of an intermodal logistic system under disruptions. Transportation Research Part E: Logistics and Transportation Review, 169, Article 102968. https://doi.org/10.1016/j.tre.2022.102968
-
Akyüz, M. H., Muter, İ., Erdoğan, G., & Laporte, G. (2022). Minimum cost delivery of multi-item orders in e-commerce logistics. Computers and Operations Research, 138, Article 105613. https://doi.org/10.1016/j.cor.2021.105613
-
Öncan, T., Şuvak, Z., Akyuz, H., & Altınel, K. (2019). Assignment problem with conflicts. Computers and Operations Research, 111, 214-229. https://doi.org/10.1016/j.cor.2019.07.001
-
Akyuz, H., Öncan, T., & Altınel, İK. (2019). Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem. Annals of Operations Research, 279(1-2), 1-42. https://doi.org/10.1007/s10479-018-3026-5
-
Akyüz, M. H. (2018). Discretization based heuristics for the capacitated multi-facility Weber problem with convex polyhedral barriers. International Journal of Optimization and Control: Theories and Applications, 8(1), 26-42. https://doi.org/10.11121/ijocta.01.2018.00388
-
Akyuz, H. (2017). The capacitated multi-facility weber problem with polyhedral barriers: Efficient heuristic methods. Computers and Industrial Engineering, 113, 221-240. https://doi.org/10.1016/j.cie.2017.09.011
-
Akyuz, H., & Lee, C.-Y. (2016). Service type assignment and container routing with transit time constraints and empty container repositioning for liner shipping service networks. Transportation Research. Part B, Methodological, 88, 46-71. https://doi.org/10.1016/j.trb.2016.02.007
-
Akyuz, H., Altinel, K., & Oncan, T. (2014). Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem. Annals of Operations Research, 222, 45-71. https://doi.org/10.1007/s10479-012-1221-3
-
Akyuz, H., & Lee, C.-Y. (2014). A mathematical formulation and efficient heuristics for the dynamic container relocation problem. Naval Research Logistics, 61, 101-118. https://doi.org/10.1002/nav.21569
-
Akyuz, H., Oncan, T., & Alt?nel, K. (2013). Beam search heuristics for the single and multi-commodity capacitated multi-facility weber problems. Computers and Operations Research, 40, 3056-3068. https://doi.org/10.1016/j.cor.2013.07.013
-
Akyuz, H., Oncan, T., & Altınel, İK. (2012). Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem. Computers and Operations Research, 39, 225-237. https://doi.org/10.1016/j.cor.2011.03.015
-
Akyuz, H., Oncan, T., & Altınel, İK. (2012). Solving the multi-commodity capacitated multi-facility Weber problem using Lagrangean relaxation and a subgradient-like algorithm. The Journal of the Operational Research Society, 63, 771-789. https://doi.org/10.1057/jors.2011.81
-
Akyuz, H., Oncan, T., & Altınel, İK. (2010). The multi-commodity capacitated multi-facility Weber problem: Heuristics and confidence intervals. IISE Transactions, 42, 825-841. https://doi.org/10.1080/0740817X.2010.491504
-
Conference proceeding (2)
-
Academic (2)
-
Öncan, T., Akyuz, H., & Altınel, K. (2019). An exact algorithm for the maximum weight perfect matching problem with conflicts. In Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (Vol. DSI Workshop Proceedings Series (online) WP19-01, pp. 111-114). https://www.ctw.ewi.utwente.nl/CTW2019ProceedingsFinal.pdf
-
Öncan, T., Akyuz, H., & Altınel, K. (2019). A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs. In Proceedings of the 9th International Network Optimization Conference (INOC) (pp. 31-36). OpenProceedings.org. https://openproceedings.org/2019/conf/inoc/INOC_2019_paper_17.pdf
-
Preprint (1)
-
Academic (1)
-
Akyüz, M. H., & Birbil, Ş. İ. (2021). Discovering Classification Rules for Interpretable Learning with Linear Programming. arXiv. arXiv preprint arXiv:2104.10751 https://arxiv.org/pdf/2104.10751
-
Additional activities (3)
-
International Conference of the ERCIM WG on Computational and Methodological Statistics
Attending an event (Academic)
-
Making Sense of Interpretable Machine Learning
Organising and contributing to an event (Academic)
-
Rule discovery for interpretable learning with linear programming
Oral presentation (Academic)
Events (3)
Address
Burgemeester Oudlaan 50
3062 PA Rotterdam
Postbus 1738
3000 DR Rotterdam
Netherlands
