default search action
Okan Örsan Özener
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j28]Milad Elyasi
, Yagmur Selenay Selcuk
Imperialist competitive algorithm for unrelated parallel machine scheduling with sequence-and-machine-dependent setups and compatibility and workload constraints. Comput. Ind. Eng. 190: 110086 (2024) - [j27]Milad Elyasi
Production planning with flexible manufacturing systems under demand uncertainty. Int. J. Prod. Res. 62(1-2): 157-170 (2024) - [j26]Furkan Cantürk
Scalable Primal Heuristics Using Graph Neural Networks for Combinatorial Optimization. J. Artif. Intell. Res. 80: 327-376 (2024) - [j25]Taha Varol
Neural Network Estimators for Optimal Tour Lengths of Traveling Salesperson Problem Instances with Arbitrary Node Distributions. Transp. Sci. 58(1): 45-66 (2024) - 2023
- [j24]Milad Elyasi
Genetic algorithms and heuristics hybridized for software architecture recovery. Autom. Softw. Eng. 30(2): 19 (2023) - [j23]Ramin Talebi Khameneh
A non-clustered approach to platelet collection routing problem. Comput. Oper. Res. 160: 106366 (2023) - [j22]Sahin Dirim, Okan Örsan Özener, Hasan Sözer
Prioritization and parallel execution of test cases for certification testing of embedded systems. Softw. Qual. J. 31(2): 471-496 (2023) - [j21]Farzad Avishan
Humanitarian Relief Distribution Problem: An Adjustable Robust Optimization Approach. Transp. Sci. 57(4): 1096-1114 (2023) - 2022
- [j20]Omer Berk Olmez
A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem. Eur. J. Oper. Res. 302(1): 187-202 (2022) - [c1]Okan Örsan Özener, Hasan Sözer:
Summary of An Effective Formulation of the Multi-Criteria Test Suite Minimization Problem. ICST 2022: 459 - 2020
- [j19]Okan Örsan Özener, Hasan Sözer
An effective formulation of the multi-criteria test suite minimization problem. J. Syst. Softw. 168: 110632 (2020) - [j18]Ali Ekici
Inventory routing for the last mile delivery of humanitarian relief supplies. OR Spectr. 42(3): 621-660 (2020)
2010 – 2019
- 2019
- [j17]Emre Çankaya, Ali Ekici
Humanitarian relief supplies distribution: an application of inventory routing problem. Ann. Oper. Res. 283(1-2): 119-141 (2019) - [j16]Ali Ekici
Cyclic ordering policies from capacitated suppliers under limited cycle time. Comput. Ind. Eng. 128: 336-345 (2019) - [j15]Okan Örsan Özener, Ali Ekici
Improving blood products supply through donation tailoring. Comput. Oper. Res. 102: 10-21 (2019) - [j14]Ali Ekici
An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics. Comput. Oper. Res. 111: 130-140 (2019) - [j13]Okan Örsan Özener:
Solving the integrated shipment routing problem of a less-than-truckload carrier. Discret. Appl. Math. 252: 37-50 (2019) - [j12]Basak Altan
Cost allocation mechanisms in a peer-to-peer network. Networks 73(1): 104-118 (2019) - 2018
- [j11]Okan Örsan Özener, Ali Ekici
Managing platelet supply through improved routing of blood collection vehicles. Comput. Oper. Res. 98: 113-126 (2018) - 2017
- [j10]Okan Örsan Özener, Melda Ormeci Matoglu
Solving a large-scale integrated fleet assignment and crew pairing problem. Ann. Oper. Res. 253(1): 477-500 (2017) - 2015
- [j9]Azadeh Mobasher, Ali Ekici
Coordinating collection and appointment scheduling operations at the blood donation sites. Comput. Ind. Eng. 87: 260-266 (2015) - [j8]Günes Erdogan
Solving a large-scale crew pairing problem. J. Oper. Res. Soc. 66(10): 1742-1754 (2015) - [j7]Ali Ekici
Cyclic Delivery Schedules for an Inventory Routing Problem. Transp. Sci. 49(4): 817-829 (2015) - [i1]Okan Örsan Özener:
Solving the Integrated Shipment Routing Problem of a LTL Carrier. CTW 2015: 28-31 - 2014
- [j6]Okan Örsan Özener, Refik Güllü, Nesim K. Erkip
Near-Optimal modified Base Stock Policies for the capacitated inventory Problem with stochastic demand and Fixed Cost. Asia Pac. J. Oper. Res. 31(3) (2014) - [j5]Serhan Duran
League scheduling and game bundling in sports industry. Comput. Ind. Eng. 74: 92-101 (2014) - [j4]Ertan Yakici, Okan Örsan Özener, Serhan Duran
Selection of event tickets for bundling in sports and entertainment industry. Comput. Ind. Eng. 74: 257-269 (2014) - 2013
- [j3]Okan Örsan Özener, Özlem Ergun, Martin W. P. Savelsbergh
Allocating Cost of Service to Customers in Inventory Routing. Oper. Res. 61(1): 112-125 (2013) - 2011
- [j2]Okan Örsan Özener, Özlem Ergun, Martin W. P. Savelsbergh
Lane-Exchange Mechanisms for Truckload Carrier Collaboration. Transp. Sci. 45(1): 1-17 (2011)
2000 – 2009
- 2008
- [b1]Okan Örsan Özener:
Collaboration in transportation. Georgia Institute of Technology, Atlanta, GA, USA, 2008 - [j1]Okan Örsan Özener, Özlem Ergun:
Allocating Costs in a Collaborative Transportation Procurement Network. Transp. Sci. 42(2): 146-165 (2008)
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 2024-06-19 20:57 CEST 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: