default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOya Ekin Karasan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Ecenur Oguz, Yalim Dogan
, Ugur Güdükbay, Oya Ekin Karasan, Mustafa Ç. Pinar:
Point cloud registration with quantile assignment. Mach. Vis. Appl. 35(3): 38 (2024)- 2022
- [j31]Oya Ekin Karasan, Alper Sen, Banu Tiryaki, A. Ercüment Çiçek:
A unifying network modeling approach for codon optimization. Bioinform. 38(16): 3935-3941 (2022) - [j30]Zehranaz Dönmez, Serkan Turhan, Özlem Karsu, Bahar Yetis Kara, Oya Ekin Karasan:
Fair allocation of personal protective equipment to health centers during early phases of a pandemic. Comput. Oper. Res. 141: 105690 (2022) - 2021
- [j29]Baris Yildiz, Hande Yaman, Oya Ekin Karasan:
Hub Location, Routing, and Route Dimensioning: Strategic and Tactical Intermodal Transportation Hub Network Design. Transp. Sci. 55(6): 1351-1369 (2021) - [c1]Stéphane Chrétien, Oya Ekin Karasan, Ecenur Oguz, Mustafa Ç. Pinar:
The Quantile Matching Problem and Point Cloud Registration. ACDA 2021: 13-20
2010 – 2019
- 2019
- [j28]Türker Tanergüçlü, Oya Ekin Karasan, Ibrahim Akgün, Ezhan Karasan:
Radio Communications Interdiction Problem under deterministic and probabilistic jamming. Comput. Oper. Res. 107: 200-217 (2019) - [j27]Claudio Arbib, Oya Ekin Karasan, Mustafa Ç. Pinar:
On envy-free perfect matching. Discret. Appl. Math. 261: 22-27 (2019) - [j26]Oyku Ahipasaoglu, Nesim Erkip, Oya Ekin Karasan:
The venue management problem: setting staffing levels, shifts and shift schedules at concession stands. J. Sched. 22(1): 69-83 (2019) - [j25]Okan Arslan, Oya Ekin Karasan, Ali Ridha Mahjoub, Hande Yaman:
A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing. Transp. Sci. 53(4): 1107-1125 (2019) - 2018
- [j24]Baris Yildiz, Oya Ekin Karasan, Hande Yaman:
Branch-and-price approaches for the network design problem with relays. Comput. Oper. Res. 92: 155-169 (2018) - [j23]Gizem Ozbaygin, Oya Ekin Karasan, Hande Yaman:
New exact solution approaches for the split delivery vehicle routing problem. EURO J. Comput. Optim. 6(1): 85-115 (2018) - 2017
- [j22]Baris Yildiz, Oya Ekin Karasan:
Regenerator Location Problem in Flexible Optical Networks. Oper. Res. 65(3): 595-620 (2017) - 2016
- [j21]G. Didem Batur Sir, Serpil Erol, Oya Ekin Karasan:
Robot move sequence determining and multiple part-type scheduling in hybrid flexible flow shop robotic cells. Comput. Ind. Eng. 100: 72-87 (2016) - [j20]Gizem Ozbaygin, Hande Yaman, Oya Ekin Karasan:
Time constrained maximal covering salesman problem with weighted demands and partial coverage. Comput. Oper. Res. 76: 226-237 (2016) - [j19]Fabio Bellini, Oya Ekin Karasan, Mustafa Ç. Pinar:
Joint mixability of some integer matrices. Discret. Optim. 20: 90-104 (2016) - [j18]Nihal Berktas, Bahar Yetis Kara, Oya Ekin Karasan:
Solution methodologies for debris removal in disaster response. EURO J. Comput. Optim. 4(3-4): 403-445 (2016) - [j17]Baris Yildiz, Okan Arslan, Oya Ekin Karasan:
A branch and price approach for routing and refueling station location model. Eur. J. Oper. Res. 248(3): 815-826 (2016) - 2014
- [j16]Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman:
Survivability in Hierarchical Telecommunications Networks Under Dual Homing. INFORMS J. Comput. 26(1): 1-15 (2014) - 2012
- [j15]Serdar Yildiz, Oya Ekin Karasan, M. Selim Akturk:
An analysis of cyclic scheduling problems in robot centered cells. Comput. Oper. Res. 39(6): 1290-1299 (2012) - [j14]Hande Yaman, Oya Ekin Karasan, Bahar Yetis Kara:
Release Time Scheduling and Hub Location for Next-Day Delivery. Oper. Res. 60(4): 906-917 (2012) - [j13]Pierre Fouilhoux, Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman:
Survivability in hierarchical telecommunications networks. Networks 59(1): 37-58 (2012) - [j12]Mehmet Rüstü Taner, Oya Ekin Karasan, Elif Yavuzturk:
Scheduling Beams with Different Priorities on a Military Surveillance Radar. IEEE Trans. Aerosp. Electron. Syst. 48(2): 1725-1739 (2012) - 2011
- [j11]Oya Ekin Karasan:
Incremental polynomial time dualization of quadratic functions and a subclass of degree-k functions. Ann. Oper. Res. 188(1): 251-261 (2011) - 2010
- [j10]Mehmet Murat Fadiloglu, Oya Ekin Karasan, Mustafa Ç. Pinar:
A model and case study for efficient shelf usage and assortment analysis. Ann. Oper. Res. 180(1): 105-124 (2010) - [j9]Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan:
Bicriteria robotic operation allocation in a flexible manufacturing cell. Comput. Oper. Res. 37(4): 779-789 (2010)
2000 – 2009
- 2009
- [j8]Hakan Gultekin, Oya Ekin Karasan, M. Selim Akturk:
Pure cycles in flexible robotic cells. Comput. Oper. Res. 36(2): 329-343 (2009) - [j7]Hatice Calik, Sibel A. Alumur, Bahar Yetis Kara, Oya Ekin Karasan:
A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Comput. Oper. Res. 36(12): 3088-3096 (2009) - 2008
- [j6]Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan:
Bicriteria robotic cell scheduling. J. Sched. 11(6): 457-473 (2008) - 2007
- [j5]Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan:
Scheduling in a three-machine robotic flexible manufacturing cell. Comput. Oper. Res. 34(8): 2463-2477 (2007) - [j4]Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar:
Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty. Math. Program. 110(2): 431-441 (2007) - 2006
- [j3]Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan:
Cyclic scheduling of a 2-machine robotic cell with tooling constraints. Eur. J. Oper. Res. 174(2): 777-796 (2006) - 2005
- [j2]M. Selim Akturk, Hakan Gultekin, Oya Ekin Karasan:
Robotic cell scheduling with operational flexibility. Discret. Appl. Math. 145(3): 334-348 (2005) - 2001
- [j1]Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar:
The robust spanning tree problem with interval data. Oper. Res. Lett. 29(1): 31-40 (2001)
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:09 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:
