default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKerem Akartunali
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j30]Willy Alves de Oliveira Soler, Maristela Oliveira Santos, Kerem Akartunali:
Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times. J. Heuristics 31(1): 1-35 (2025)- 2023
- [j29]Eduardo M. Silva
, Gislaine Mara Melega, Kerem Akartunali, Silvio A. de Araujo:
Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost. Eur. J. Oper. Res. 304(2): 443-460 (2023) - [j28]Bin Liu, Kerem Akartunali, Stéphane Dauzère-Pérès, Shaomin Wu:
Special issue on collaborative production and maintenance in the environment of big data and industry 4.0. Int. J. Prod. Res. 61(23): 8236-8237 (2023) - [j27]Valdemar Abrão P. A. Devesse, Kerem Akartunali, Márcio da Silva Arantes, Claudio Fabiano Motta Toledo:
Linear approximations to improve lower bounds of a physician scheduling problem in emergency rooms. J. Oper. Res. Soc. 74(3): 888-904 (2023) - 2022
- [j26]Kerem Akartunali, Stéphane Dauzère-Pérès:
Dynamic lot sizing with stochastic demand timing. Eur. J. Oper. Res. 302(1): 221-229 (2022) - [j25]Glory Uche Alozie, Ashwin Arulselvan, Kerem Akartunali, Eduardo L. Pasiliao:
A heuristic approach for the distance-based critical node detection problem in complex networks. J. Oper. Res. Soc. 73(6): 1347-1361 (2022) - [j24]Ashwin Arulselvan, Kerem Akartunali, Wilco van den Heuvel:
Economic lot-sizing problem with remanufacturing option: complexity and algorithms. Optim. Lett. 16(2): 421-432 (2022) - 2021
- [j23]Glory Uche Alozie, Ashwin Arulselvan, Kerem Akartunali, Eduardo L. Pasiliao Jr.:
Efficient methods for the distance-based critical node detection problem in complex networks. Comput. Oper. Res. 131: 105254 (2021) - [j22]Öykü Naz Attila, Agostinho Agra, Kerem Akartunali, Ashwin Arulselvan:
Robust formulations for economic lot-sizing problem with remanufacturing. Eur. J. Oper. Res. 288(2): 496-510 (2021) - [j21]Willy Alves de Oliveira Soler, Maristela Oliveira Santos, Kerem Akartunali:
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. 72(8): 1691-1706 (2021) - [j20]Mateusz Polnik, Annalisa Riccardi, Kerem Akartunali:
A multistage optimisation algorithm for the large vehicle routing problem with time windows and synchronised visits. J. Oper. Res. Soc. 72(11): 2396-2411 (2021) - 2020
- [j19]Nilabhra Banerjee, Alec Morton, Kerem Akartunali:
Passenger demand forecasting in scheduled transportation. Eur. J. Oper. Res. 286(3): 797-810 (2020)
2010 – 2019
- 2018
- [j18]Euan Barlow, Diclehan Tezcaner Öztürk, Matthew Revie, Kerem Akartunali, Alexander H. Day, Evangelos Boulougouris:
A mixed-method optimisation and simulation framework for supporting logistical decisions during offshore wind farm installations. Eur. J. Oper. Res. 264(3): 894-906 (2018) - [j17]Mahdi Doostmohammadi, Kerem Akartunali:
Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: Zero setup case. Eur. J. Oper. Res. 267(1): 86-95 (2018) - [j16]Alex Leggate, Seda Sucu, Kerem Akartunali, Robert B. Van der Meer:
Modelling crew scheduling in offshore supply vessels. J. Oper. Res. Soc. 69(6): 959-970 (2018) - 2017
- [j15]Kerem Akartunali, Philip A. Knight:
Network models and biproportional rounding for fair seat allocations in the UK elections. Ann. Oper. Res. 253(1): 1-19 (2017) - [j14]Erfan Rahimian, Kerem Akartunali, John Levine:
A hybrid integer and constraint programming approach to solve nurse rostering problems. Comput. Oper. Res. 82: 83-94 (2017) - [j13]Erfan Rahimian, Kerem Akartunali, John Levine:
A hybrid Integer Programming and Variable Neighbourhood Search algorithm to solve Nurse Rostering Problems. Eur. J. Oper. Res. 258(2): 411-423 (2017) - [j12]Tao Wu, Kerem Akartunali, Raf Jans, Zhe Liang:
Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem. INFORMS J. Comput. 29(3): 523-543 (2017) - [j11]Martin Paton, Kerem Akartunali, Desmond J. Higham:
Centrality Analysis for Modified Lattices. SIAM J. Matrix Anal. Appl. 38(3): 1055-1073 (2017) - [c2]Öykü Naz Attila, Agostinho Agra, Kerem Akartunali, Ashwin Arulselvan:
A Decomposition Algorithm for Robust Lot Sizing Problem with Remanufacturing Option. ICCSA (2) 2017: 684-695 - 2016
- [j10]Kerem Akartunali, Ioannis Fragkos, Andrew J. Miller, Tao Wu:
Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems. INFORMS J. Comput. 28(4): 766-780 (2016) - [c1]Kerem Akartunali, Ashwin Arulselvan:
Economic Lot-Sizing Problem with Remanufacturing Option: Complexity and Algorithms. MOD 2016: 132-143 - 2015
- [j9]Kerem Akartunali, Vicky H. Mak-Hau, Thu Tran:
A unified mixed-integer programming model for simultaneous fluence weight and aperture optimization in VMAT, Tomotherapy, and Cyberknife. Comput. Oper. Res. 56: 134-150 (2015) - [j8]Claudio Fabiano Motta Toledo, Márcio da Silva Arantes, Marcelo Yukio Bressan Hossomi, Paulo Morelato França, Kerem Akartunali:
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems. J. Heuristics 21(5): 687-717 (2015) - 2013
- [j7]Kerem Akartunali, Natashia Boland, Ian Evans, Mark Wallace, Hamish Waterer:
Airline planning benchmark problems - Part I: : Characterising networks and demand using limited data. Comput. Oper. Res. 40(3): 775-792 (2013) - [j6]Kerem Akartunali, Natashia Boland, Ian Evans, Mark Wallace, Hamish Waterer:
Airline planning benchmark problems - Part II: Passenger groups, utility and demand allocation. Comput. Oper. Res. 40(3): 793-804 (2013) - [j5]Tao Wu, Kerem Akartunali, Jie Song, Leyuan Shi:
Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms. Discret. Event Dyn. Syst. 23(2): 211-239 (2013) - 2012
- [j4]Kerem Akartunali, Andrew J. Miller:
A computational analysis of lower bounds for big bucket production planning problems. Comput. Optim. Appl. 53(3): 729-753 (2012) - [j3]Tao Wu, Leyuan Shi, Joseph Geunes, Kerem Akartunali:
On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times. J. Glob. Optim. 53(4): 615-639 (2012) - 2011
- [j2]Tao Wu, Leyuan Shi, Joseph Geunes, Kerem Akartunali:
An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging. Eur. J. Oper. Res. 214(2): 428-441 (2011)
2000 – 2009
- 2009
- [j1]Kerem Akartunali, Andrew J. Miller:
A heuristic approach for big bucket multi-level production planning problems. Eur. J. Oper. Res. 193(2): 396-411 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
