Kerem Akartunali
Orcid: 0000-0003-0169-3833
According to our database1,
Kerem Akartunali
authored at least 32 papers
between 2009 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2025
Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times.
J. Heuristics, March, 2025
2023
Special issue on collaborative production and maintenance in the environment of big data and industry 4.0.
Int. J. Prod. Res., December, 2023
Linear approximations to improve lower bounds of a physician scheduling problem in emergency rooms.
J. Oper. Res. Soc., March, 2023
Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost.
Eur. J. Oper. Res., 2023
2022
Optim. Lett., 2022
A heuristic approach for the distance-based critical node detection problem in complex networks.
J. Oper. Res. Soc., 2022
2021
MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products.
J. Oper. Res. Soc., 2021
A multistage optimisation algorithm for the large vehicle routing problem with time windows and synchronised visits.
J. Oper. Res. Soc., 2021
Eur. J. Oper. Res., 2021
Efficient methods for the distance-based critical node detection problem in complex networks.
Comput. Oper. Res., 2021
2020
2018
Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: Zero setup case.
Eur. J. Oper. Res., 2018
A mixed-method optimisation and simulation framework for supporting logistical decisions during offshore wind farm installations.
Eur. J. Oper. Res., 2018
2017
INFORMS J. Comput., 2017
A hybrid Integer Programming and Variable Neighbourhood Search algorithm to solve Nurse Rostering Problems.
Eur. J. Oper. Res., 2017
A hybrid integer and constraint programming approach to solve nurse rostering problems.
Comput. Oper. Res., 2017
Network models and biproportional rounding for fair seat allocations in the UK elections.
Ann. Oper. Res., 2017
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017
2016
INFORMS J. Comput., 2016
Proceedings of the Machine Learning, Optimization, and Big Data, 2016
2015
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems.
J. Heuristics, 2015
A unified mixed-integer programming model for simultaneous fluence weight and aperture optimization in VMAT, Tomotherapy, and Cyberknife.
Comput. Oper. Res., 2015
2013
Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms.
Discret. Event Dyn. Syst., 2013
Airline planning benchmark problems - Part II: Passenger groups, utility and demand allocation.
Comput. Oper. Res., 2013
Airline planning benchmark problems - Part I: : Characterising networks and demand using limited data.
Comput. Oper. Res., 2013
2012
On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times.
J. Glob. Optim., 2012
A computational analysis of lower bounds for big bucket production planning problems.
Comput. Optim. Appl., 2012
2011
An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging.
Eur. J. Oper. Res., 2011
2009
Eur. J. Oper. Res., 2009