@article {1602, title = {Column generation-based prototype learning for optimizing area under the receiver operating characteristic curve}, journal = {European Journal of Operational Research}, volume = {314}, year = {2024}, pages = {297{\textendash}307}, author = {Erhan C Ozcan and Berk G{\"o}rg{\"u}l{\"u} and Mustafa Gokce Baydogan} } @article {1513, title = {Dynamic trade-offs in granulocyte colony-stimulating factor (G-CSF) administration during chemotherapy}, journal = {System Dynamics Review}, volume = {36}, year = {2021}, pages = {397{\textendash}446}, abstract = {

Chemotherapeutic treatment of cancer comes with side effects on the immune system, such as Chemotherapy-Induced Neutropenia (CIN). A recombinant form of Granulocyte Colony-Stimulating Factor (G-CSF) has been used to alleviate CIN. This is a challenging task due to the feedback complexity of the hematological system. A System Dynamics model is constructed to study this system and to derive practical insights for the management of CIN. Stimulation of neutrophil production via G-CSF is observed to propose crucial trade-offs. On one hand, production by stem cells and mobilization from bone marrow should be stimulated to compensate for the impairment caused by chemotherapy. On the other hand, it is important to avoid overstimulation, which reduces the regenerative capacity, as well as draining the much-needed bone-marrow reservoir. Our analysis supports the intuition that the response to G-CSF administration is conditional to patient characteristics, and {\textquotedblleft}one for all{\textquotedblright} treatment protocols are impractical. {\textcopyright} 2021 System Dynamics Society.

}, issn = {10991727}, doi = {10.1002/sdr.1671}, author = {{\.I}rsoy, Orkun and G{\"u}z, {\c S}anser and Akan, Naz Beril and G{\"o}nen{\c c} Y{\"u}cel} } @article {1420, title = {Explainable boosted linear regression for time series forecasting}, journal = {Pattern Recognition}, volume = {120}, year = {2021}, pages = {108144}, abstract = {

Time series forecasting involves collecting and analyzing past observations to develop a model to extrapolate such observations into the future. Forecasting of future events is important in many fields to support decision making as it contributes to reducing the future uncertainty. We propose explainable boosted linear regression (EBLR) algorithm for time series forecasting, which is an iterative method that starts with a base model, and explains the model{\textquoteright}s errors through regression trees. At each iteration, the path leading to highest error is added as a new variable to the base model. In this regard, our approach can be considered as an improvement over general time series models since it enables incorporating nonlinear features by residual explanation. More importantly, use of the single rule that contributes to the error most enables access to interpretable results. The proposed approach extends to probabilistic forecasting through generating prediction intervals based on the empirical error distribution. We conduct a detailed numerical study with EBLR and compare against various other approaches. We observe that EBLR substantially improves the base model performance through extracted features, and provide a comparable performance to other well established approaches. The interpretability of the model predictions and high predictive accuracy of EBLR makes it a promising method for time series forecasting.

}, keywords = {ARIMA, Decision trees, Linear regression, Probabilistic forecasting, Time series regression}, issn = {0031-3203}, doi = {https://doi.org/10.1016/j.patcog.2021.108144}, url = {https://www.sciencedirect.com/science/article/pii/S0031320321003319}, author = {Igor Ilic and Berk G{\"o}rg{\"u}l{\"u} and Mucahit Cevik and Mustafa Gokce Baydogan} } @article {1421, title = {Randomized trees for time series representation and similarity}, journal = {Pattern Recognition}, volume = {120}, year = {2021}, pages = {108097}, abstract = {

Most of the temporal data mining tasks require representations to capture important characteristics of time series. Representation learning is challenging when time series differ in distributional characteristics and/or show irregularities such as varying lengths and missing observations. Moreover, when time series are multivariate, interactions between variables should be modeled efficiently. This study proposes a unified, flexible time series representation learning framework for both univariate and multivariate time series called Rand-TS. Rand-TS models density characteristics of each time series as a time-varying Gaussian distribution using random decision trees and embeds density information into a sparse vector. Rand-TS can work with time series of various lengths and missing observations, furthermore, it allows using customized features. We illustrate the classification performance of Rand-TS on 113 univariate, 19 multivariate along with 15 univariate time series with varying lengths from UCR database. The results show that in addition to its flexibility, Rand-TS provides competitive classification performance.

}, keywords = {Classification, Random trees, Representation learning, Time series}, issn = {0031-3203}, doi = {https://doi.org/10.1016/j.patcog.2021.108097}, url = {https://www.sciencedirect.com/science/article/pii/S0031320321002843}, author = {Berk G{\"o}rg{\"u}l{\"u} and Mustafa Gokce Baydogan} } @article {1454, title = {An exact and implementable computation of the final outbreak size distribution under Erlang distributed infectious period}, journal = {Mathematical Biosciences}, volume = {325}, year = {2020}, pages = {108363}, abstract = {

This paper deals with a stochastic SIR (Susceptible{\textendash}Infected{\textendash}Recovered) model with Erlang(k,μ) distributed infectious period commonly referred as SIkR model. We show that using the total number of remaining Erlang stages as the state variable, we do not need to keep track of the stages of individual infections, and can employ a first step analysis to efficiently obtain quantities of interest. We study the distribution of the total number of recovered individuals and the distribution of the maximum number of individuals who are simultaneously infected until the end of the disease. In the literature, final outbreak size is calculated only for a small population size exactly and derivations of approximate analytic solutions from asymptotic results are suggested for larger population sizes. We numerically demonstrate that our methods are implementable on large size problem instances.

}, keywords = {Erlang distributed infectious period, Final size distribution, Markov models, Maximum size distribution, Stochastic SIR}, issn = {0025-5564}, doi = {https://doi.org/10.1016/j.mbs.2020.108363}, url = {https://www.sciencedirect.com/science/article/pii/S0025556420300547}, author = {Zeynep G{\"o}k{\c c}e {\.I}{\c s}lier and Refik G{\"u}ll{\"u} and Wolfgang H{\"o}rmann} } @article {1499, title = {Mind the independence gap}, journal = {Discrete Mathematics}, volume = {343}, year = {2020}, pages = {111943}, abstract = {

The independence gap of a graph was introduced by Ekim et al.\ in 2018 as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal independent set. We investigate the independence gap of a graph from structural and algorithmic points of view, with a focus on classes of perfect graphs. Generalizing results on well-covered graphs due to Dean and Zito (1994) and Hujdurovi{\'c} et al.\ (2018), we express the independence gap of a perfect graph in terms of clique partitions and use this characterization to develop a polynomial-time algorithm for recognizing graphs of constant independence gap in any class of perfect graphs of bounded clique number. Next, we introduce a hereditary variant of the parameter, which we call hereditary independence gap and which measures the maximum independence gap over all induced subgraphs of the graph. We show that determining whether a given graph has hereditary independence gap at most k is polynomial-time solvable if k is fixed and co-NP-complete if k is part of input. We also investigate the complexity of the independent set and independent domination problems in graph classes related to independence gap. In particular, we show that the two problems are NP-complete in the class of graphs of independence gap at most one and that the weighted independent set problem is polynomial-time solvable in any class of graphs with bounded hereditary independence gap. Combined with some known results on claw-free graphs, our results imply that the independent domination problem is solvable in polynomial time in the class of {claw, 2P3}-free graphs.

}, keywords = {Hereditary independence gap, Independent dominating set, Maximal independent set, NP-hard problem, Polynomial-time algorithm, Well-covered graph}, issn = {0012-365X}, doi = {https://doi.org/10.1016/j.disc.2020.111943}, url = {https://www.sciencedirect.com/science/article/pii/S0012365X20301321}, author = {Ekim, Tinaz and Didem G{\"o}z{\"u}pek and Ademir Hujdurovi{\'c} and Martin Milani{\v c}} } @article {1436, title = {Minimizing the misinformation spread in social networks}, journal = {IISE Transactions}, volume = {52}, year = {2020}, pages = {850-863}, abstract = {

AbstractThe Influence Maximization Problem has been widely studied in recent years, due to rich application areas including marketing. It involves finding k nodes to trigger a spread such that the expected number of influenced nodes is maximized. The problem we address in this study is an extension of the reverse influence maximization problem, i.e., misinformation minimization problem where two players make decisions sequentially in the form of a Stackelberg game. The first player aims to minimize the spread of misinformation whereas the second player aims its maximization. Two algorithms, one greedy heuristic and one matheuristic, are proposed for the first player{\textquoteright}s problem. In both of them, the second player{\textquoteright}s problem is approximated by Sample Average Approximation, a well-known method for solving two-stage stochastic programming problems, that is augmented with a state-of-the-art algorithm developed for the influence maximization problem.

}, doi = {10.1080/24725854.2019.1680909}, url = {https://doi.org/10.1080/24725854.2019.1680909}, author = {K{\"u}bra Tan{\i}nm{\i}{\c s} and Necati Aras and I. Kuban Altinel and Evren G{\"u}ney} } @article {1453, title = {Next-day operating room scheduling with uncertain surgery durations: Exact analysis and heuristics}, journal = {European Journal of Operational Research}, volume = {286}, year = {2020}, pages = {49-62}, abstract = {

Operating rooms are units of particular interest in hospitals as they constitute more than 40\% of total expenses and revenues. Managing operating rooms is challenging due to conflicting priorities and preferences of various stakeholders and the inherent uncertainty of surgery durations. In this study, we consider the next-day scheduling problem of a hospital operating room. Given the list and the sequence of non-identical surgeries to be performed in the next day, one needs to determine the scheduled durations of surgeries where the actual duration of each surgery is uncertain. Our objective is to minimize the weighted sum of expected patient waiting times, room idle time and overtime. First, we provide a reformulation of the objective function in terms of auxiliary functions with a recursive pattern that enables exact analysis of the optimal surgery durations at the expense of high CPU time. Next, we develop and analyze simple-to-use and close-to-optimal scheduling heuristics motivated by practice, for the OR managers to deploy in the field. Our proposed hybrid heuristic attains 1.22\% average performance gap and worst average optimality gap of 2.77\%. Our solution is easy to implement as it does not require any advanced optimization tool, which is the reality of many operating room environments.

}, keywords = {Heuristics, Operating room planning, OR in health services, Scheduling, Stochastic optimization}, issn = {0377-2217}, doi = {https://doi.org/10.1016/j.ejor.2020.03.002}, url = {https://www.sciencedirect.com/science/article/pii/S0377221720302162}, author = {Taghi Khaniyev and Enis Kay{\i}{\c s} and Refik G{\"u}ll{\"u}} } @article {1455, title = {{Effect of a secondary market on a system with random demand and uncertain costs}}, journal = {International Journal of Production Economics}, volume = {209}, year = {2019}, pages = {112-120}, abstract = {

In this paper, we consider inventory and pricing decisions for a system where the customer demand can be partitioned into two segments: a primary and a secondary market. These kinds of systems are observed, for instance, in technology intensive products or services where the primary market, being more loyal, is generally not too sensitive to the pricing of the product or service. While the primary market customer demand occurs right after the introduction of the product, the secondary market customer demand typically occurs after the product matures, and these customers are much more sensitive to changes in the sales price. The purchasing costs of technology intensive products very much depend on the spot currency exchange rate, and hence can be modelled as a stochastic process. Consequently, the sales price for the primary market customers can be assumed to be a mark-up of the spot purchasing cost of the product. On the other hand, as the secondary market customers are more sensitive to the sales price, a demand model, where the customer demand explicitly depends on the selling price would be more appropriate. We try to accomplish three objectives: (1) to model the described system, (2) to find the optimal initial quantity to stock, and (3) to determine the optimal sales price for the secondary market customers.

}, keywords = {Inventory model, Price driven demand, Stochastic price}, doi = {10.1016/j.ijpe.2018.05.01}, url = {https://ideas.repec.org/a/eee/proeco/v209y2019icp112-120.html}, author = {G{\"u}rel, Y{\"u}cel and Refik G{\"u}ll{\"u}} } @article {1418, title = {Estimation of Influence Distance of Bus Stops Using Bus GPS Data and Bus Stop Properties}, journal = {IEEE Transactions on Intelligent Transportation Systems}, volume = {20}, year = {2019}, pages = {4635-4642}, doi = {10.1109/TITS.2019.2909645}, author = {Gokasar, Ilgin and Cetinel, Yigit and Mustafa Gokce Baydogan} } @article {1500, title = {Small 1-defective Ramsey numbers in perfect graphs}, journal = {Discrete Optimization}, volume = {34}, year = {2019}, pages = {100548}, abstract = {

In this paper, we initiate the study of defective Ramsey numbers for the class of perfect graphs. Let PG be the class of all perfect graphs and R1PG(i,j) denote the smallest n such that all perfect graphs on n vertices have either a 1-dense i-set or a 1-sparse j-set. We show that R1PG(3,j)=j for any j>=2, R1PG(4,4)=6, R1PG(4,5)=8, R1PG(4,6)=10, R1PG(4,7)=13, R1PG(4,8)=15 and R1PG(5,5)=13. We exhibit all extremal graphs for R1PG(4,7)=13 (there are exactly three). We also obtain the 1-defective Ramsey number of order (4,7) in triangle-free perfect graphs, namely R1ΔPG(4,7)=12.

}, keywords = {-dense, -dependent, -sparse, Extremal graphs}, issn = {1572-5286}, doi = {https://doi.org/10.1016/j.disopt.2019.06.001}, url = {https://www.sciencedirect.com/science/article/pii/S1572528618301622}, author = {Ekim, Tinaz and John Gimbel and Oylum {\c S}eker} } @article {1503, title = {On Almost Well-Covered Graphs of Girth at Least 6}, journal = {Discrete Mathematics \& Theoretical Computer Science}, volume = {20}, year = {2018}, author = {Milani{\v c}, Martin and Hujdurovi{\'c}, Ademir and G{\"o}z{\"u}pek, Didem and Ekim, Tinaz} } @article {1509, title = {Equimatchable claw-free graphs}, journal = {Discrete Mathematics}, volume = {341}, year = {2018}, pages = {2859-2871}, abstract = {

A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide the first characterization of claw-free equimatchable graphs by identifying the equimatchable claw-free graph families. This characterization implies an efficient recognition algorithm.

}, keywords = {Connectivity, Equimatchable graph, Factor-critical}, issn = {0012-365X}, doi = {https://doi.org/10.1016/j.disc.2018.06.043}, url = {https://www.sciencedirect.com/science/article/pii/S0012365X18302140}, author = {Saieed Akbari and Hadi Alizadeh and Ekim, Tinaz and Didem G{\"o}z{\"u}pek and Mordechai Shalom} } @article {1488, title = {A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand}, journal = {International Journal of Production Research}, volume = {56}, year = {2018}, pages = {3344-3357}, abstract = {

We investigate a parallel machine multi-item lot-sizing and scheduling problem with a secondary resource, in which demands are given for the entire planning horizon rather than for every single period. All-or-nothing assumption of the discrete lot-sizing and scheduling problem is valid so that a machine is either idle or works at full capacity in a period. The objective is to minimise the number of setups and teardowns. We prove that the problem is NP-hard and present two equivalent formulations. We show some properties of the optimal objective value, give optimality conditions and suggest a heuristic algorithm. We discuss and formulate two possible extensions related to real-life applications. Finally, we carry out computational experiments to compare the two formulations, to determine the effect of our proposed modeling improvements on solution performance, and to test the quality of our heuristic.

}, doi = {10.1080/00207543.2017.1406675}, url = {https://doi.org/10.1080/00207543.2017.1406675}, author = {Murat G{\"u}ng{\"o}r and Ali Tamer {\"U}nal and Z C Ta{\c s}k{\i}n} } @article {1160, title = {Accelerating Transition Dynamics in City Regions: A Qualitative Modeling Perspective}, journal = {Sustainability}, volume = {9}, year = {2017}, pages = {1254}, author = {Valkering, Pieter and G{\"o}nen{\c c} Y{\"u}cel and Gebetsroither-Geringer, Ernst and Markvica, Karin and Meynaerts, Erika and Frantzeskaki, Niki} } @inbook {1187, title = {Affect measurement: A roadmap through approaches, technologies, and data analysis}, booktitle = {Emotions and Affect in Human Factors and Human-Computer Interaction}, year = {2017}, pages = {255{\textendash}288}, publisher = {Elsevier}, organization = {Elsevier}, author = {Gonzalez-Sanchez, Javier and Mustafa Gokce Baydogan and Chavez-Echeagaray, Maria Elena and Atkinson, Robert K and Burleson, Winslow} } @article {1508, title = {On matching extendability of lexicographic products}, journal = {RAIRO-Oper. Res.}, volume = {51}, year = {2017}, pages = {857-873}, doi = {10.1051/ro/2016072}, url = {https://doi.org/10.1051/ro/2016072}, author = {Chiarelli, Nina and Dibek, Cemil and Ekim, Tinaz and G{\"o}z{\"u}pek, Didem and Miklavic, Stefko} } @article {1162, title = {Mispricing in Option Pricing Models Versus Market Payoffs: An Efficiency-Based Performance Metric}, journal = {Wilmott}, volume = {2017}, year = {2017}, pages = {44{\textendash}57}, author = {Orbay, Berk and Refik G{\"u}ll{\"u} and Wolfgang H{\"o}rmann} } @article {1188, title = {The Shifting the Burden Archetype: A Workforce and Task Backlog Management Game}, journal = {Korean System Dynamics Review}, volume = {17}, year = {2017}, pages = {81-110}, author = {S.Z. G{\"u}ran and Hakan Ya{\c s}arcan} } @article {1495, title = {The Shifting the Burden Archetype A Workforce and Task Backlog Management Game}, journal = {Korean System Dynamics Review}, volume = {4}, year = {2017}, month = {Feb}, pages = {81{\textendash}110}, author = {G{\"u}ran, Seniha Zeynep and Yasarcan, Hakan} } @article {1178, title = {Equimatchable graphs are C2k+ 1-free for k>= 4}, journal = {Discrete Mathematics}, volume = {339}, year = {2016}, pages = {2964{\textendash}2969}, author = {Dibek, Cemil and Ekim, Tinaz and G{\"o}z{\"u}pek, Didem and Shalom, Mordechai} } @article {1174, title = {Innovation race under revenue and technology uncertainty of heterogeneous firms where the winner does not take all}, journal = {IIE Transactions}, volume = {48}, year = {2016}, pages = {527{\textendash}540}, author = {Taner Bilgi{\c c} and Refik G{\"u}ll{\"u}} } @article {785, title = {A column generation approach for evaluating delivery efficiencies of collimator technologies in IMRT treatment planning}, journal = {Physics in Medicine and Biology}, volume = {60}, year = {2015}, pages = {1989-2004}, author = {Merve G{\"o}ren and Z C Ta{\c s}k{\i}n} } @article {guler2015joint, title = {Joint pricing and inventory control for additive demand models with reference effects}, journal = {Annals of Operations Research}, volume = {226}, number = {1}, year = {2015}, pages = {255{\textendash}276}, publisher = {Springer US}, author = {G{\"u}ler, M G{\"u}ray and Taner Bilgi{\c c} and Refik G{\"u}ll{\"u}} } @article {786, title = {Mathematical Programming-Based Sales and Operations Planning at Vestel Electronics}, journal = {Interfaces}, volume = {45}, year = {2015}, pages = {325-340}, doi = {http://dx.doi.org/10.1287/inte.2015.0793}, author = {Z C Ta{\c s}k{\i}n and Semra A{\u g}ral{\i} and Ali Tamer {\"U}nal and Vahdet Belada and Filiz G{\"o}kten-Y{\i}lmaz} } @article {1468, title = {An Adaptive CONWIP Mechanism for Hybrid Production Systems}, journal = {International Journal of Advanced Manufacturing Technology}, volume = {74}, year = {2014}, pages = {715{\textendash}727}, author = {Aybek Korugan and Gupta, Surendra M} } @article {guler2014joint, title = {Joint inventory and pricing decisions when customers are delay sensitive}, journal = {International Journal of Production Economics}, volume = {157}, year = {2014}, pages = {302{\textendash}312}, publisher = {Elsevier}, author = {G{\"u}ler, M G{\"u}ray and Taner Bilgi{\c c} and Refik G{\"u}ll{\"u}} } @article {GBG2014a, title = {Joint inventory and pricing decisions with reference effects}, journal = {IIE Transactions}, volume = {46}, number = {4}, year = {2014}, pages = {330{\textendash}343}, publisher = {Taylor \& Francis Group}, author = {G{\"u}ler, M G{\"u}ray and Taner Bilgi{\c c} and Refi̇k G{\"u}ll{\"u}} } @inbook {Yucel2013a, title = {The actor-option framework: a general framework for modelling socio-technical systems in transitions}, booktitle = {Infranomics: Sustainability, Engineering Design and Governance}, series = {Topics in Safety, Risk, Reliability and Quality}, volume = {24}, year = {2013}, pages = {407{\textendash}418}, publisher = {Springer International Publishing}, organization = {Springer International Publishing}, address = {Cham}, keywords = {modelling, simulation, socio-technical transitions}, isbn = {978-3-319-02492-9}, doi = {10.1007/978-3-319-02493-6}, url = {http://link.springer.com/10.1007/978-3-319-02493-6}, author = {G{\"o}nen{\c c} Y{\"u}cel}, editor = {Gheorghe, Adrian V. and Masera, Marcelo and Katina, Polinpapilinho F.} } @conference {39, title = {Affect Recognition in Learning Scenarios: Matching Facial-and BCI-Based Values}, booktitle = {13th IEEE International Conference on Advanced Learning Technologies (ICALT{\textquoteright}13)}, year = {2013}, publisher = {IEEE}, organization = {IEEE}, author = {Javier Gonzalez-Sanchez and Maria Elena Chavez-Echeagaray and Lijia Lin and Mustafa Gokce Baydogan and Robert Christopherson and David Gibson and Robert Atkinson and Winslow Burleson} } @article {ekim2013some, title = {Some Defective Parameters in Graphs}, journal = {Graphs and Combinatorics}, volume = {29}, number = {2}, year = {2013}, pages = {213{\textendash}224}, publisher = {Springer Japan}, author = {Ekim, Tinaz and Gimbel, John} } @inbook {ekcsiouglu2013user, title = {A user experience study of airline websites}, booktitle = {Design, User Experience, and Usability. Web, Mobile, and Product Design}, year = {2013}, pages = {173{\textendash}182}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {Mahmut Ek{\c s}io{\u g}lu and Kiris, Esin and \cCak{\i}r, Tu{\u g}ba and G{\"u}vendik, Merve and Koyut{\"u}rk, Efsane D and Y{\i}lmaz, Merve} } @article {guney2012efficient, title = {Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks}, journal = {Computers \& Operations Research}, volume = {39}, number = {7}, year = {2012}, pages = {1530{\textendash}1539}, publisher = {Elsevier}, author = {G{\"u}ney, Evren and Necati Aras and I. Kuban Altinel and Ersoy, Cem} } @article {AgraliEtAl2012, title = {A Facility Location Model with Safety Stock Costs: Analysis of the Cost of Single-Sourcing Requirements}, journal = {Journal of Global Optimization}, volume = {54(3)}, year = {2012}, pages = {551-581}, doi = {http://dx.doi.org/10.1007/s10898-011-9777-z}, author = {Semra A{\u g}ral{\i} and Joseph Geunes and Z C Ta{\c s}k{\i}n} } @article {barlas2011demand, title = {Demand forecasting and sharing strategies to reduce fluctuations and the bullwhip effect in supply chains}, journal = {Journal of the Operational Research Society}, volume = {62}, number = {3}, year = {2011}, pages = {458{\textendash}473}, publisher = {Nature Publishing Group}, author = {Yaman Barlas and Baris Gunduz} } @article {aras2011optimal, title = {Optimal inventory and pricing policies for remanufacturable leased products}, journal = {International Journal of Production Economics}, volume = {133}, number = {1}, year = {2011}, pages = {262{\textendash}271}, publisher = {Elsevier}, author = {Necati Aras and Refik G{\"u}ll{\"u} and Y{\"u}r{\"u}lmez, Sevil} } @article {13988334, title = {{Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks}}, journal = {Computer Networks}, volume = {54}, year = {2010}, pages = {1805{\textendash}1822}, doi = {10.1016/j.comnet.2010.02.009}, author = {Evren G{\"u}ney and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @book {13282841, title = {{A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks}}, series = {EvoWorkshops}, year = {2010}, pages = {83{\textendash}94}, doi = {10.1007/978-3-642-12139-5_8}, author = {Evren G{\"u}ney and I. Kuban Altinel and Necati Aras and Cem Ersoy} } @article {guler2009coordinating, title = {On coordinating an assembly system under random yield and random demand}, journal = {European Journal of Operational Research}, volume = {196}, number = {1}, year = {2009}, pages = {342{\textendash}350}, publisher = {Elsevier}, author = {G{\"u}ler, M G{\"u}ray and Taner Bilgi{\c c}} } @article {ekim2009partitioning, title = {Partitioning graphs into complete and empty graphs}, journal = {Discrete Mathematics}, volume = {309}, number = {19}, year = {2009}, pages = {5849{\textendash}5856}, publisher = {Elsevier}, author = {Ekim, Tinaz and Gimbel, John} } @conference {50780509, title = {{A Variable Neighborhood Search Heuristic for Point Coverage, Sink Location and Data Routing in Wireless Sensor Networks}}, booktitle = {International Conference on Communication Theory, Reliability, and Quality of Service}, year = {2009}, doi = {10.1109/CTRQ.2009.33}, author = {Evren G{\"u}ney and I. Kuban Altinel and Necati Aras and Cem Ersoy} } @article {4363814, title = {{Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks}}, journal = {Computer Networks}, volume = {52}, year = {2008}, pages = {2419{\textendash}2431}, doi = {10.1016/j.comnet.2008.05.002}, author = {I. Kuban Altinel and Necati Aras and Evren G{\"u}ney and Cem Ersoy} } @article {geinoz2008construction, title = {Construction of balanced sports schedules using partitions into subleagues}, journal = {Operations Research Letters}, volume = {36}, number = {3}, year = {2008}, pages = {279{\textendash}282}, publisher = {North-Holland}, author = {Geinoz, A and Ekim, Tinaz and de Werra, Dominique} } @conference {guney2008efficient, title = {Efficient integer programming formulations for optimum sink location and routing in wireless sensor networks}, booktitle = {Computer and Information Sciences, 2008. ISCIS{\textquoteright}08. 23rd International Symposium on}, year = {2008}, pages = {1{\textendash}6}, publisher = {IEEE}, organization = {IEEE}, author = {Guney, E and I. Kuban Altinel and Necati Aras and Ersoy, Cem} } @article {50507263, title = {{Effective coverage in sensor networks: Binary integer programming formulations and heuristics}}, volume = {9}, year = {2006}, pages = {4014{\textendash}4019}, doi = {10.1109/ICC.2006.255709}, author = {I. Kuban Altinel and Necati Aras and Evren G{\"u}ney and Cem Ersoy} } @conference {gursoy2005tekstil, title = {Tekstil End{\"u}strisinde bir {\.I}{\c s} {\.I}stasyonunun Ergonomik Analizi: Remay{\"o}z Makinesi}, booktitle = {11. Ulusal Ergonomi Kongresi}, year = {2005}, author = {G{\"u}rsoy, Selin and Erhan, G{\"o}n{\"u}lta{\c s} and Mahmut Ek{\c s}io{\u g}lu} } @article {1472, title = {A multi echelon inventory system with returns}, journal = {Computers \& Industrial Engineering}, volume = {35}, year = {1998}, month = {Oct}, pages = {145{\textendash}148}, issn = {03608352}, author = {Aybek Korugan and Gupta, Surendra M} }