default search action
Onur Kaya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]Tugçe Yavuz, Onur Kaya
:
Deep reinforcement learning algorithms for dynamic pricing and inventory management of perishable products. Appl. Soft Comput. 163: 111864 (2024) - [j26]Ilknur Tükenmez
A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles. J. Heuristics 30(5): 359-396 (2024) - [j25]Ilknur Tükenmez, Tugba Saraç, Onur Kaya:
Correction to: A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles. J. Heuristics 30(5): 397 (2024) - [c31]Roozbeh Bonakdar, Çagatay Edemen, M. Emin Akbulut, Onur Keskin, Onur Kaya, Murat Uysal:
Visible Light Communication with Solar Cell Receiver for Indoor IoT Applications. SIU 2024: 1-4 - 2023
- [c30]Özkan Tugberk Kartal, Onur Kaya, Elif Uysal:
Resource Allocation in the Finite Blocklength Regime Under PAoI and Delay Violation Constraints. WiOpt 2023: 539-546 - 2022
- [j24]Müge Acar
Inventory decisions for humanitarian aid materials considering budget constraints. Eur. J. Oper. Res. 300(1): 95-111 (2022) - [j23]Elif Uysal
Semantic Communications in Networked Systems: A Data Significance Perspective. IEEE Netw. 36(4): 233-240 (2022) - 2021
- [j22]Melda Hasiloglu, Onur Kaya
An analysis of price, service and commission rate decisions in online sales made through E-commerce platforms. Comput. Ind. Eng. 162: 107688 (2021) - [j21]Mehmet Alegoz
A comparison of pure manufacturing and hybrid manufacturing-remanufacturing systems under carbon tax policy. Eur. J. Oper. Res. 294(1): 161-173 (2021) - [c29]Orhan Tahir Yavascan, Elif Tugce Ceran, Zeynep Çakir, Onur Kaya, Elif Uysal
When To Pull Data for Minimum Age Penalty. WiOpt 2021: 169-176 - [i4]Elif Uysal, Onur Kaya, Anthony Ephremides, James Gross, Marian Codreanu, Petar Popovski, Mohamad Assaad, Gianluigi Liva, Andrea Munari, Touraj Soleymani, Beatriz Soret, Karl Henrik Johansson:
Semantic Communications in Networked Systems. CoRR abs/2103.05391 (2021) - [i3]Elif Uysal, Onur Kaya, Sajjad Baghaee, Hasan Burhan Beytur:
Age of Information in Practice. CoRR abs/2106.02491 (2021) - 2020
- [j20]Mehmet Alegoz
Closing the loop in supply chains: Economic and environmental effects. Comput. Ind. Eng. 142: 106366 (2020) - [j19]Onur Kaya
Public and private healthcare coordination: An analysis of contract mechanisms based on subsidy payments. Comput. Ind. Eng. 146: 106526 (2020) - [c28]Doga Can Atabay, Elif Uysal
Improving Age of Information in Random Access Channels. INFOCOM Workshops 2020: 912-917
2010 – 2019
- 2019
- [c27]Mehmet Alegoz
A Comparison of Forward and Closed-Loop Supply Chains. OR 2019: 707-714 - 2018
- [j18]Onur Kaya
Supply chain contracts for capacity decisions under symmetric and asymmetric information. Central Eur. J. Oper. Res. 26(1): 67-92 (2018) - [j17]Onur Kaya
Inventory control and pricing for perishable products under age and price dependent stochastic demand. Math. Methods Oper. Res. 88(1): 1-35 (2018) - [j16]Berk Gurakan, Onur Kaya
Energy and Data Cooperative Multiple Access Channel With Intermittent Data Arrivals. IEEE Trans. Wirel. Commun. 17(3): 2016-2028 (2018) - [c26]Onur Kaya
A network design problem with location, inventory and routing decisions. GECCO (Companion) 2018: 139-140 - [c25]Baran Tan Bacinoglu, Onur Kaya, Elif Uysal-Biyikoglu
Energy efficient transmission scheduling for channel-adaptive wireless energy transfer. WCNC 2018: 1-6 - 2017
- [j15]Mehmet Alegoz
Coordinated dispatching and acquisition fee decisions for a collection center in a reverse supply chain. Comput. Ind. Eng. 113: 475-486 (2017) - [j14]Onur Kaya
Coordinated pricing and inventory decisions for perishable products. OR Spectr. 39(2): 589-606 (2017) - [c24]Nugman Su, Onur Kaya, Mutlu Koca:
Energy harvesting cooperative multiple access under energy storage losses. SIU 2017: 1-4 - 2016
- [j13]Onur Kaya
A mixed integer nonlinear programming model and heuristic solutions for location, inventory and pricing decisions in a closed loop supply chain. Comput. Oper. Res. 65: 93-103 (2016) - [c23]Ahmed Arafa, Onur Kaya, Sennur Ulukus:
Energy harvesting cooperative multiple access channel with decoding costs. EUSIPCO 2016: 587-591 - [c22]Berk Gurakan, Onur Kaya, Sennur Ulukus:
Energy harvesting cooperative multiple access channel with data arrivals. ICC 2016: 1-6 - [c21]Onur Kaya, Nugman Su, Sennur Ulukus, Mutlu Koca:
Delay tolerant cooperation in the energy harvesting multiple access channel. ITA 2016: 1-8 - [c20]Onur Kaya, Dag Bergsjö
Useful deviations for deviation management information systems: From pulse methodology to a generic description. SoSE 2016: 1-6 - [c19]Berk Gurakan, Berrak Sisman
Energy and data cooperation in energy harvesting multiple access channel. WCNC 2016: 1-6 - [c18]Berk Gurakan, Berrak Sisman
Energy and data cooperation in energy harvesting multiple access channel. WCNC Workshops 2016: 410-415 - 2015
- [c17]Nugman Su, Onur Kaya, Sennur Ulukus, Mutlu Koca:
Cooperative Multiple Access under Energy Harvesting Constraints. GLOBECOM 2015: 1-6 - 2014
- [j12]Deniz Aksen
An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem. Eur. J. Oper. Res. 239(2): 413-426 (2014) - [j11]Çagatay Edemen
Cognitive Cooperative MAC With One Primary and Two Secondary Users: Achievable Rates and Optimal Power Control. IEEE Commun. Lett. 18(11): 1895-1898 (2014) - [c16]Onur Kaya, Daniel Stenholm
Towards Global Deviation Management in Product Development Using Pulse Methodology: A Case Study. CSER 2014: 265-274 - [c15]Onur Kaya, Amer Catic, Dag Bergsjö
Exploring the Possibilities of Using Image Recognition Technology to Create a Hybrid Lean System for Pulse Methodology. CSER 2014: 275-284 - [c14]Saygin Baksi, Onur Kaya:
Optimal primary-secondary user pairing and power allocation in cognitive cooperative multiple access channels. ICNC 2014: 955-960 - 2013
- [j10]Onur Kaya
Stochastic models for the coordinated production and shipment problem in a supply chain. Comput. Ind. Eng. 64(3): 838-849 (2013) - [j9]Onur Kaya
Dynamic pricing of durable products with heterogeneous customers and demand interactions over time. Comput. Ind. Eng. 65(4): 679-688 (2013) - [j8]Sezi Bakim, Onur Kaya
Power Control for Two User Cooperative OFDMA Channels. IEEE Trans. Wirel. Commun. 12(1): 258-267 (2013) - [c13]Çagatay Edemen
A new block Markov coding strategy for pairwise and collective cooperation in the three user MAC. BlackSeaCom 2013: 152-156 - [c12]Teoman Mert, Onur Kaya, Hakan A. Çirpan
Jointly optimal chunk and power allocation in uplink SC-FDMA. ICC 2013: 3393-3397 - [c11]Saygin Baksi, Onur Kaya, Türker Bíyíkoglu:
Enabling cooperation, resource allocation and receiver selection across cells: Complementary fractional frequency reuse. PIMRC 2013: 1190-1195 - 2012
- [j7]Deniz Aksen
Selective and periodic inventory routing problem for waste vegetable oil collection. Optim. Lett. 6(6): 1063-1080 (2012) - [c10]Onur Kaya, Murat Isleyen:
Power control in the cognitive cooperative multiple access channel. CISS 2012: 1-5 - [c9]Mehmet Gunes, Onur Kaya:
Joint decode/compress and forward based cooperative multiple access. SIU 2012: 1-4 - [c8]Saygin Baksi, Onur Kaya, Türker Bíyíkoglu:
Optimal and near-optimal partner selection algorithms in cooperative OFDMA. WCNC 2012: 475-479 - [i2]Sezi Bakim, Onur Kaya:
Power Control for Two User Cooperative OFDMA Channels. CoRR abs/1207.6255 (2012) - 2011
- [j6]Sezi Bakim, Onur Kaya
Cooperative Strategies and Achievable Rates for Two User OFDMA Channels. IEEE Trans. Wirel. Commun. 10(12): 4029-4034 (2011) - [c7]Sezi Bakim, Onur Kaya:
Optimum power control for transmitter cooperation in OFDMA based wireless networks. GLOBECOM Workshops 2011: 464-469 - 2010
- [j5]Onur Kaya
Incentive and production decisions for remanufacturing operations. Eur. J. Oper. Res. 201(2): 442-453 (2010) - [c6]Sezi Bakim, Onur Kaya:
Achievable Rates for Two User Cooperative OFDMA. GLOBECOM 2010: 1-5
2000 – 2009
- 2008
- [c5]Çagatay Edemen
Channel Adaptive Encoding and Decoding Strategies and Rate Regions for the Three User Cooperative Multiple Access Channel. GLOBECOM 2008: 987-991 - [c4]Çagatay Edemen
Achievable Rates for the Three User Cooperative Multiple Access Channel. WCNC 2008: 1507-1512 - 2007
- [j4]Onur Kaya
Power Control for Fading Cooperative Multiple Access Channels. IEEE Trans. Wirel. Commun. 6(8): 2915-2923 (2007) - 2006
- [j3]Onur Kaya
Achieving the Capacity Region Boundary of Fading CDMA Channels via Generalized Iterative Waterfilling. IEEE Trans. Wirel. Commun. 5(11): 3215-3223 (2006) - [c3]Onur Kaya:
Window And Backwards Decoding Achieve the Same Sum Rate for the Fading Cooperative Gaussian Multiple Access Channel. GLOBECOM 2006 - [i1]Onur Kaya, Sennur Ulukus:
Power Control for User Cooperation. CoRR abs/cs/0601124 (2006) - 2005
- [b1]Onur Kaya:
Achievable Rates, Optimal Signalling Schemes and Resource Allocation for Fading Wireless Channels. University of Maryland, College Park, MD, USA, 2005 - [j2]Onur Kaya
Ergodic sum capacity maximization for CDMA: Optimum resource allocation. IEEE Trans. Inf. Theory 51(5): 1831-1836 (2005) - 2004
- [j1]Onur Kaya
Optimum power control for CDMA with deterministic sequences in fading channels. IEEE Trans. Inf. Theory 50(10): 2449-2462 (2004) - [c2]Onur Kaya, Sennur Ulukus:
Capacity region of power controlled fading CDMA: transmit strategies and convexity issues. ISIT 2004: 353 - 2003
- [c1]Onur Kaya
Jointly optimal power and signature sequence allocation for fading CDMA. GLOBECOM 2003: 1872-1876
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-11-07 20:27 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: