Oya Ekin Karasan

According to our database, Oya Ekin Karasan authored at least 33 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Point cloud registration with quantile assignment.

Ecenur Oguz, Yalim Dogan, Ugur Güdükbay, Oya Ekin Karasan, Mustafa Ç. Pinar

Mach. Vis. Appl., May, 2024

2022

Fair allocation of personal protective equipment to health centers during early phases of a pandemic.

Zehranaz Dönmez, Serkan Turhan, Özlem Karsu, Bahar Yetis Kara, Oya Ekin Karasan

Comput. Oper. Res., 2022

A unifying network modeling approach for codon optimization.

Oya Ekin Karasan, Alper Sen, Banu Tiryaki, A. Ercüment Çiçek

Bioinform., 2022

2021

Hub Location, Routing, and Route Dimensioning: Strategic and Tactical Intermodal Transportation Hub Network Design.

Baris Yildiz, Hande Yaman, Oya Ekin Karasan

Transp. Sci., 2021

The Quantile Matching Problem and Point Cloud Registration.

Stéphane Chrétien, Oya Ekin Karasan, Ecenur Oguz, Mustafa Ç. Pinar

Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2019

A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing.

Okan Arslan, Oya Ekin Karasan, Ali Ridha Mahjoub, Hande Yaman

Transp. Sci., 2019

The venue management problem: setting staffing levels, shifts and shift schedules at concession stands.

Oyku Ahipasaoglu, Nesim Erkip, Oya Ekin Karasan

J. Sched., 2019

On envy-free perfect matching.

Claudio Arbib, Oya Ekin Karasan, Mustafa Ç. Pinar

Discret. Appl. Math., 2019

Radio Communications Interdiction Problem under deterministic and probabilistic jamming.

Türker Tanergüçlü, Oya Ekin Karasan, Ibrahim Akgün, Ezhan Karasan

Comput. Oper. Res., 2019

2018

New exact solution approaches for the split delivery vehicle routing problem.

Gizem Ozbaygin, Oya Ekin Karasan, Hande Yaman

EURO J. Comput. Optim., 2018

Branch-and-price approaches for the network design problem with relays.

Baris Yildiz, Oya Ekin Karasan, Hande Yaman

Comput. Oper. Res., 2018

2017

Regenerator Location Problem in Flexible Optical Networks.

Baris Yildiz, Oya Ekin Karasan

Oper. Res., 2017

2016

A branch and price approach for routing and refueling station location model.

Baris Yildiz, Okan Arslan, Oya Ekin Karasan

Eur. J. Oper. Res., 2016

Solution methodologies for debris removal in disaster response.

Nihal Berktas, Bahar Yetis Kara, Oya Ekin Karasan

EURO J. Comput. Optim., 2016

Joint mixability of some integer matrices.

Fabio Bellini, Oya Ekin Karasan, Mustafa Ç. Pinar

Discret. Optim., 2016

Time constrained maximal covering salesman problem with weighted demands and partial coverage.

Gizem Ozbaygin, Hande Yaman, Oya Ekin Karasan

Comput. Oper. Res., 2016

Robot move sequence determining and multiple part-type scheduling in hybrid flexible flow shop robotic cells.

G. Didem Batur Sir, Serpil Erol, Oya Ekin Karasan

Comput. Ind. Eng., 2016

2014

Survivability in Hierarchical Telecommunications Networks Under Dual Homing.

Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman

INFORMS J. Comput., 2014

2012

Scheduling Beams with Different Priorities on a Military Surveillance Radar.

Mehmet Rüstü Taner, Oya Ekin Karasan, Elif Yavuzturk

IEEE Trans. Aerosp. Electron. Syst., 2012

Survivability in hierarchical telecommunications networks.

Pierre Fouilhoux, Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman

Networks, 2012

Release Time Scheduling and Hub Location for Next-Day Delivery.

Hande Yaman, Oya Ekin Karasan, Bahar Yetis Kara

Oper. Res., 2012

An analysis of cyclic scheduling problems in robot centered cells.

Serdar Yildiz, Oya Ekin Karasan, M. Selim Akturk

Comput. Oper. Res., 2012

2011

Incremental polynomial time dualization of quadratic functions and a subclass of degree-<i>k</i> functions.

Oya Ekin Karasan

Ann. Oper. Res., 2011

2010

Bicriteria robotic operation allocation in a flexible manufacturing cell.

Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan

Comput. Oper. Res., 2010

A model and case study for efficient shelf usage and assortment analysis.

Mehmet Murat Fadiloglu, Oya Ekin Karasan, Mustafa Ç. Pinar

Ann. Oper. Res., 2010

2009

Pure cycles in flexible robotic cells.

Hakan Gultekin, Oya Ekin Karasan, M. Selim Akturk

Comput. Oper. Res., 2009

A tabu-search based heuristic for the hub covering problem over incomplete hub networks.

Hatice Calik, Sibel A. Alumur, Bahar Yetis Kara, Oya Ekin Karasan

Comput. Oper. Res., 2009

2008

Bicriteria robotic cell scheduling.

Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan

J. Sched., 2008

2007

Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty.

Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar

Math. Program., 2007

Scheduling in a three-machine robotic flexible manufacturing cell.

Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan

Comput. Oper. Res., 2007

2006

Cyclic scheduling of a 2-machine robotic cell with tooling constraints.

Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan

Eur. J. Oper. Res., 2006

2005

Robotic cell scheduling with operational flexibility.

M. Selim Akturk, Hakan Gultekin, Oya Ekin Karasan

Discret. Appl. Math., 2005

2001

The robust spanning tree problem with interval data.

Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar

Oper. Res. Lett., 2001