Follow
M. Hakan Akyüz
Title
Cited by
Cited by
Year
A mathematical formulation and efficient heuristics for the dynamic container relocation problem
M Hakan Akyüz, CY Lee
Naval Research Logistics (NRL) 61 (2), 101-118, 2014
562014
Service type assignment and container routing with transit time constraints and empty container repositioning for liner shipping service networks
MH Akyüz, CY Lee
Transportation Research Part B: Methodological 88, 46-71, 2016
292016
Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
MH Akyüz, IK Altınel, T Öncan
Annals of Operations Research 222 (1), 45-71, 2014
242014
Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
MH Akyüz, T Öncan, İK Altınel
Computers & operations research 39 (2), 225-237, 2012
212012
Assignment problem with conflicts
T Öncan, Z Şuvak, MH Akyüz, İK Altınel
Computers & Operations Research 111, 214-229, 2019
172019
The multi-commodity capacitated multi-facility Weber problem: Heuristics and confidence intervals
MH Akyüz, T Öncan, IK Altinel
IIE Transactions 42 (11), 825-841, 2010
152010
Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
MH Akyüz, T Öncan, İK Altınel
Annals of Operations Research 279 (1-2), 1-42, 2019
142019
Beam search heuristics for the single and multi-commodity capacitated multi-facility weber problems
MH Akyüz, T Öncan, İK Altınel
Computers & operations research 40 (12), 3056-3068, 2013
122013
Solving the multi-commodity capacitated multi-facility Weber problem using Lagrangean relaxation and a subgradient-like algorithm
MH Akyüz, T Öncan, İK Altınel
Journal of the Operational Research Society 63 (6), 771-789, 2012
102012
The capacitated multi-facility Weber problem with polyhedral barriers: efficient heuristic methods
MH Akyüz
Computers & Industrial Engineering 113, 221-240, 2017
72017
Discretization based heuristics for the capacitated multi-facility Weber problem with convex polyhedral barriers
MH Akyüz
An International Journal of Optimization and Control: Theories …, 2018
52018
Minimum cost delivery of multi-item orders in e-commerce logistics
MH Akyüz, İ Muter, G Erdoğan, G Laporte
Computers & Operations Research 138, 105613, 2022
22022
Discovering Classification Rules for Interpretable Learning with Linear Programming
MH Akyüz, Şİ Birbil
arXiv preprint arXiv:2104.10751, 2021
12021
Solving a minisum single facility location problem in three regions with different norms
G Altay, MH Akyüz, T Öncan
Annals of Operations Research, 1-37, 2022
2022
Learning with Subset Stacking
SI Birbil, S Yildirim, K Gokalp, H Akyuz
arXiv preprint arXiv:2112.06251, 2021
2021
A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs
T Öncan, MH Akyüz, İK Altınel
INOC 2019 Proceedings of the 9th International Network Optimization …, 2019
2019
Allocation and Location Space Based Branch and Bound Algorithms for the Capacitated Multi-facility Weber Problem
MH Akyüz, IK Altınel, T Oncan
ORP3 2011 - The OR Peripatetic Post-Graduate Programme Conference …, 2011
2011
The system can't perform the operation now. Try again later.
Articles 1–17