@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 {1538, title = {Multiple instance classification via quadratic programming}, journal = {Journal of Global Optimization}, year = {2022}, pages = {1{\textendash}32}, author = {Emel {\c S}eyma K{\"u}{\c c}{\"u}ka{\c s}c{\i} and Mustafa Gokce Baydogan and Z C Ta{\c s}k{\i}n} } @article {1536, title = {nTreeClus: A tree-based sequence encoder for clustering categorical series}, journal = {Neurocomputing}, volume = {494}, year = {2022}, pages = {224-241}, abstract = {

The overwhelming presence of categorical/sequential data in diverse domains emphasizes the importance of sequence mining. The challenging nature of sequences proves the need for continuing research to find a more accurate and faster approach providing a better understanding of their (dis) similarities. This paper proposes a new Model-based approach for clustering sequence data, namely nTreeClus. The proposed method deploys Tree-based Learners, k-mers, and autoregressive models for categorical time series, culminating with a novel numerical representation of the categorical sequences. Adopting this new representation, we cluster sequences, considering the inherent patterns in categorical time series. Accordingly, the model showed robustness to its parameter. Under different simulated scenarios, nTreeClus improved the baseline methods for various internal and external cluster validation metrics for up to 10.7\% and 2.7\%, respectively. The empirical evaluation using synthetic and real datasets, protein sequences, and categorical time series showed that nTreeClus is competitive or superior to most state-of-the-art algorithms.

}, keywords = {Categorical time series, Model-based clustering, Pattern recognition, Sequence mining, Tree-based learning}, issn = {0925-2312}, doi = {https://doi.org/10.1016/j.neucom.2022.04.076}, url = {https://www.sciencedirect.com/science/article/pii/S0925231222004611}, author = {Hadi Jahanshahi and Mustafa Gokce Baydogan} } @article {1537, title = {Semi-supervised extensions of multi-task tree ensembles}, journal = {Pattern Recognition}, volume = {123}, year = {2022}, pages = {108393}, abstract = {

Scale inconsistency is a widely encountered issue in multi-output learning problems. Specifically, target sets with multiple real valued or a mixture of categorical and real valued variables require addressing the scale differences to obtain predictive models with sufficiently good performance. Data transformation techniques are often employed to solve that problem. However, these operations are susceptible to different shortcomings such as changing the statistical properties of the data and increase the computational burden. Scale differences also pose problem in semi-supervised learning (SSL) models as they require processing of unsupervised information where distance measures are commonly employed. Classical distance metrics can be criticized as they lose efficiency when variables exhibit type or scale differences, too. Besides, in higher dimensions distance metrics cause problems due to loss of discriminative power. This paper introduces alternative semi-supervised tree-based strategies that are robust to scale differences both in terms of feature and target variables. We propose use of a scale-invariant proximity measure by means of tree-based ensembles to preserve the original characteristics of the data. We update classical tree derivation procedure to a multi-criteria form to resolve scale inconsistencies. We define proximity based clustering indicators and extend the supervised model with unsupervised criteria. Our experiments show that proposed method significantly outperforms its benchmark learning model that is predictive clustering trees.

}, keywords = {Ensemble learning, Multi-objective trees, Multi-task learning, Semi-supervised learning, Totally randomized trees}, issn = {0031-3203}, doi = {https://doi.org/10.1016/j.patcog.2021.108393}, url = {https://www.sciencedirect.com/science/article/pii/S0031320321005549}, author = {Esra Ad{\i}yeke and Mustafa Gokce Baydogan} } @article {1540, title = {A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production}, journal = {Computers \& Operations Research}, volume = {135}, year = {2021}, pages = {105430}, doi = {https://doi.org/10.1016/j.cor.2021.105430}, author = {Serkan Kalay and Z C Ta{\c s}k{\i}n} } @article {1539, title = {A Branch-Price-and-Cut Algorithm for Optimal Decoding of LDPC Codes}, journal = {Journal of Global Optimization}, volume = {81}, year = {2021}, pages = {805{\textendash}834}, doi = {https://doi.org/10.1007/s10898-021-01073-4}, author = {Banu Kabakulak and Z C Ta{\c s}k{\i}n and Ali Emre Pusane} } @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 {1423, title = {An ensemble-based semi-supervised feature ranking for multi-target regression problems}, journal = {Pattern Recognition Letters}, volume = {148}, year = {2021}, pages = {36-42}, abstract = {

This study focuses on semi-supervised feature ranking (FR) applications for multi-target regression problems (MTR). As MTRs require prediction of several targets, we use a learning model that includes target interrelations via multi-objective trees. In processing the features for a semi-supervised learning model, transformation or scaling operations are usually required. To resolve this issue, we create a dissimilarity matrix via totally randomized trees to process the unsupervised information. Besides, we treat the split score function as a vector to make it suitable for considering each criterion regardless of their scales. We propose a semi-supervised FR scheme embedded to multi-objective trees that takes into account target and feature contributions simultaneously. Proposed FR score is compared with the state-of-the-art multi-target FR strategies via statistical analyses. Experimental studies show that proposed score significantly improves the performance of a recent tree-based and competitive multi-target learning model, i.e. predictive clustering trees. In addition, proposed approach outperforms its benchmarks when the available labelled data increase.

}, keywords = {Feature ranking, Multi-target regression, Semi-supervised learning}, issn = {0167-8655}, doi = {https://doi.org/10.1016/j.patrec.2021.04.025}, url = {https://www.sciencedirect.com/science/article/pii/S0167865521001641}, author = {Esra Ad{\i}yeke and Mustafa Gokce Baydogan} } @article {1542, title = {An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs}, journal = {European Journal of Operational Research}, volume = {291(1)}, year = {2021}, pages = {67{\textendash}83}, doi = {https://doi.org/10.1016/j.ejor.2020.09.017}, author = {Oylum {\c S}eker and Ekim, Tinaz and Z C Ta{\c s}k{\i}n} } @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 {1535, title = {Learning prototypes for multiple instance learning.}, journal = {Turkish Journal of Electrical Engineering \& Computer Sciences}, volume = {29}, year = {2021}, author = {{\"O}zg{\"u}r Emre Sivrikaya and Mert Y{\"u}kselg{\"o}n{\"u}l and Mustafa Gokce Baydogan} } @article {1424, title = {A linear programming approach to multiple instance learning}, journal = {Turkish Journal of Electrical Engineering \& Computer Sciences}, volume = {29}, year = {2021}, pages = {2186{\textendash}2201}, author = {Emel {\c S}eyma K{\"u}{\c c}{\"u}ka{\c s}c{\i} and Mustafa Gokce Baydogan and Z C Ta{\c s}k{\i}n} } @article {1422, title = {A new feature-based time series classification method by using scale-space extrema}, journal = {Engineering Science and Technology, an International Journal}, year = {2021}, abstract = {

Time series data mining has received significant attention over the past decade, and many approaches have focused on classification tasks where the goal is to define the label of a test time series, given labeled training data. Time series classification approaches can be broadly grouped into two categories as instance-based and feature-based methods. Instance-based approaches utilize similarity information in a nearest-neighbor setting to classify time series data. Although approaches from this category provide accurate results, their performance degrades with long and noisy time series. On the other hand, feature-based approaches extract features to deal with the limitations of instance-based approaches; however, these approaches work with predefined features and may not be successful in certain classification problems. This study proposes a time series classification approach that benefits from both scale-space theory and bag-of-features technique. The method starts with finding the scale-space extrema points (i.e. key points) of each time series according to the SiZer (SIgnificant ZERo crossings of the derivatives) method, and then proceeds to create the local features set around these points. After extraction of the local features from each key point, a bag-of-features representation for each time series is constructed as the summary of the key point characteristics. We evaluate the success of the proposed representation on time series classification problems from various domains. Our experimental results show that our proposal provides competitive results compared to widely used approaches in the literature.

}, keywords = {Bag-of-Features Technique, Feature-based Classification, Scale-Space Theory, SiZer, time series classification}, issn = {2215-0986}, doi = {https://doi.org/10.1016/j.jestch.2021.03.017}, url = {https://www.sciencedirect.com/science/article/pii/S2215098621000823}, author = {Tayip Altay 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 {1541, title = {Single Machine Campaign Planning under Sequence Dependent Family Setups and Co-Production}, journal = {Journal of the Operational Research Society}, volume = {72}, year = {2021}, pages = {2091{\textendash}2111}, doi = {https://doi.org/10.1080/01605682.2020.1772016}, author = {Serkan Kalay and Z C Ta{\c s}k{\i}n} } @article {1417, title = {Analysis of an individual-based influenza epidemic model using random forest metamodels and adaptive sequential sampling}, journal = {Systems Research and Behavioral Science}, volume = {37}, year = {2020}, pages = {936-958}, abstract = {

Abstract This study proposes a three-step procedure for the analysis of input{\textendash}response relationships of dynamic models, which enables the analyst to develop a better understanding about the dynamics of the system. The main building block of the procedure is a random forest metamodel capturing the input{\textendash}output relationships. We utilize an active learning approach as the second step to improve the accuracy of the metamodel. In the last step, we develop a novel way to present the information captured by the metamodel as a set of intelligible IF{\textendash}THEN rules. For illustration, we use the FluTE model, which is an individual-based influenza epidemic model. We observe that the number of daily applicable vaccines determines the success of an intervention strategy the most. Another critical observation is that when the daily available vaccines are constrained, nonpharmaceutical strategies should be incorporated to reduce the extent of the outbreak.

}, keywords = {adaptive sequential sampling, FluTE, individual-based modelling, Metamodeling, Rule Extraction}, doi = {https://doi.org/10.1002/sres.2763}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/sres.2763}, author = {Edali, Mert and G{\"o}nen{\c c} Y{\"u}cel} } @article {1419, title = {The benefits of target relations: A comparison of multitask extensions and classifier chains}, journal = {Pattern Recognition}, volume = {107}, year = {2020}, pages = {107507}, abstract = {

Multitask (multi-target or multi-output) learning (MTL) deals with simultaneous prediction of several outputs. MTL approaches rely on the optimization of a joint score function over the targets. However, defining a joint score in global models is problematic when the target scales are different. To address such problems, single target (i.e. local) learning strategies are commonly employed. Here we propose alternative tree-based learning strategies to handle the issue with target scaling in global models, and to identify the learning order for chaining operations in local models. In the first proposal, the problems with target scaling are resolved using alternative splitting strategies which consider the learning tasks in a multi-objective optimization framework. The second proposal deals with the problem of ordering in the chaining strategies. We introduce an alternative estimation strategy, minimum error chain policy, that gradually expands the input space using the estimations that approximate to true characteristics of outputs, namely out-of-bag estimations in tree-based ensemble framework. Our experiments on benchmark datasets illustrate the success of the proposed multitask extension of trees compared to the decision trees with de facto design especially for datasets with large number of targets. In line with that, minimum error chain policy improves the performance of the state-of-the-art chaining policies.

}, keywords = {Classifier chains, Ensemble learning, Multi-objective trees, Multitask learning, Stacking}, issn = {0031-3203}, doi = {https://doi.org/10.1016/j.patcog.2020.107507}, url = {https://www.sciencedirect.com/science/article/pii/S0031320320303101}, author = {Esra Ad{\i}yeke and Mustafa Gokce Baydogan} } @article {1426, title = {A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems}, journal = {Networks}, volume = {75}, year = {2020}, pages = {137-157}, abstract = {

Abstract We study a bipartite graph (BG) construction problem that arises in digital communication systems. In a digital communication system, information is sent from one place to another over a noisy communication channel using binary symbols (bits). The original information is encoded by adding redundant bits, which are then used to detect and correct errors that may have been introduced during transmission. Harmful structures, such as small cycles, severely deteriorate the error correction capability of a BG. We introduce an integer programming formulation to generate a BG for a given smallest cycle length. We propose a branch-and-cut algorithm for its solution and investigate the structural properties of the problem to derive valid inequalities and variable fixing rules. We also introduce heuristics to obtain feasible solutions for the problem. The computational experiments show that our algorithm can generate BGs without small cycles in an acceptable amount of time for practically relevant dimensions.

}, keywords = {bipartite graphs, branch-and-cut algorithm, integer programming, symmetry, telecommunications, valid inequalities}, doi = {https://doi.org/10.1002/net.21914}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21914}, author = {Banu Kabakulak and Z C Ta{\c s}k{\i}n and Pusane, Ali E.} } @article {1498, title = {The complexity of the defensive domination problem in special graph classes}, journal = {Discrete Mathematics}, volume = {343}, year = {2020}, pages = {111665}, abstract = {

A k-attack on a graph G is a set of k distinct vertices {a1,{\textellipsis},ak} which are said to be under attack. A k-attack A can be countered or defended by a subset of defender vertices X if and only if there exists an injective function f from A to X, such that either f(ai)=ai or (ai,f(ai)) is an edge of G, for all i, 1<=i<=k. Given a graph G, a subset D of V is a k-defensive dominating set of G if and only if D can counter any k-attack in G. We consider the k-defensive dominating set problem. We start a systematic study on the complexity of the k-defensive dominating set problem. When k is not fixed, we show that it is already co-NP-hard to decide whether a given set of vertices is a k-defensive dominating set or not. However, if k is fixed, then we show that the problem is NP-complete even in split graphs. Subsequently, we consider special graph classes, namely paths, cycles, co-chain graphs and threshold graphs. We show that in each of these graph classes, a k-defensive dominating set of minimum size can be found in linear time even for non-fixed k.

}, keywords = {Domination, Networks, Security}, issn = {0012-365X}, doi = {https://doi.org/10.1016/j.disc.2019.111665}, url = {https://www.sciencedirect.com/science/article/pii/S0012365X19303437}, author = {Ekim, Tinaz and Arthur M. Farley and Andrzej Proskurowski} } @article {1428, title = {On the Construction of Regular QC-LDPC Codes With Low Error Floor}, journal = {IEEE Communications Letters}, volume = {24}, year = {2020}, pages = {25-28}, doi = {10.1109/LCOMM.2019.2953058}, author = {Sar{\i}duman, Abdullah and Pusane, Ali E. and Z C Ta{\c s}k{\i}n} } @article {1425, title = {Decentralized decomposition algorithms for peer-to-peer linear optimization}, journal = {RAIRO-Oper. Res.}, volume = {54}, year = {2020}, pages = {1835-1861}, doi = {10.1051/ro/2019097}, url = {https://doi.org/10.1051/ro/2019097}, author = {Aydin, M. Asli and Z C Ta{\c s}k{\i}n} } @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 {1441, title = {Exact solution algorithms for the maximum flow problem with additional conflict constraints}, journal = {European Journal of Operational Research}, volume = {287}, year = {2020}, pages = {410-437}, abstract = {

We consider a variant of the maximum flow problem on a given directed graph where some arc pairs are incompatible or conflicting; in other words, they are not allowed to carry positive flow simultaneously. This problem, called the maximum flow problem with conflicts, is known to be strongly NP-hard. In this paper, we present mixed-integer linear programming formulations for the problem and develop exact solution methods based on Benders decomposition, branch-and-bound, and Russian Doll Search over the conflict graph which represents the conflict relations. The effectiveness of the proposed algorithms is tested on a large number of randomly generated instances. The results reveal that their performances are superior to solving the mixed-integer linear programming formulations with a commercial software.

}, keywords = {Benders decomposition, Branch-and-bound, Combinatorial optimization, Conflict, Maximum flow, Russian doll search}, issn = {0377-2217}, doi = {https://doi.org/10.1016/j.ejor.2020.04.001}, url = {https://www.sciencedirect.com/science/article/pii/S0377221720303192}, author = {Zeynep {\c S}uvak and I. Kuban Altinel and Necati Aras} } @article {1446, title = {Gradual covering location problem with multi-type facilities considering customer preferences}, journal = {Computers \& Industrial Engineering}, volume = {147}, year = {2020}, pages = {106577}, abstract = {

In this paper, we address a discrete facility location problem where a retailer aims at locating new facilities with possibly different characteristics. Customers visit the facilities based on their preferences which are represented as probabilities. These probabilities are determined in a novel way by using a fuzzy clustering algorithm. It is assumed that the sum of the probabilities with which customers at a given demand zone patronize different types of facilities is equal to one. However, among the same type of facilities they choose the closest facility, and the strength at which this facility covers the customer is based on two distances referred to as full coverage distance and gradual (partial) coverage distance. If the distance between the customer location and the closest facility is smaller (larger) than the full (partial) coverage distance, this customer is fully (not) covered, whereas for all distance values between full and partial coverage, the customer is partially covered. Both distance values depend on both the customer attributes and the type of the facility. Furthermore, facilities can only be opened if their revenue exceeds a certain threshold value. A final restriction is incorporated into the model by defining a minimum separation distance between the same facility types. This restriction is also extended to the case where a minimum threshold distance exists among facilities of different types. The objective of the retailer is to find the optimal locations and types of the new facilities in order to maximize its profit. Two versions of the problem are formulated using integer linear programming, which differ according to whether the minimum separation distance applies to the same facility type or different facility types. The resulting integer linear programming models are solved by three approaches: commercial solver CPLEX, heuristics based on Lagrangean relaxation, and local search implemented with 1-Add and 1-Swap moves. Apart from experimentally assessing the accuracy and the efficiency of the solution methods on a set of randomly generated test instances, we also carry out sensitivity analysis using a real-world problem instance.

}, keywords = {Customer preferences, Facility location, Fuzzy c-means clustering, Gradual coverage, Lagrangean relaxation}, issn = {0360-8352}, doi = {https://doi.org/10.1016/j.cie.2020.106577}, url = {https://www.sciencedirect.com/science/article/pii/S0360835220303119}, author = {Hande K{\"u}{\c c}{\"u}kaydin and Necati Aras} } @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 {1449, title = {Modeling the pharmacodynamics of nandrolone doping drug and implications for anti-doping testing}, journal = {System Dynamics Review}, volume = {36}, year = {2020}, pages = {467-496}, abstract = {

Abstract We model the pathways of nandrolone in the body, an anabolic steroid widely used as a performance enhancing drug (PED). The model generates the dynamics of nandrolone and its metabolites. PED tests check for the presence of a primary metabolite of nandrolone, 19-NA in urine. To cheat in these tests, PED users typically use inhibitors that reduce the urinary concentration of 19-NA. One such inhibitor is finasteride. Finasteride{\textquoteright}s main effect in the body is the inhibition of reductase enzymes that turn nandrolone into its metabolite 19-NA. To capture this effect, we include structures for finasteride and reductase enzymes in the model. The model is tested by fundamental structure validity tests. We also show that the model behavior is consistent with experimental data in the literature. We finally investigate the potential ways by which the drug users may cheat in PED tests and make suggestions for improved testing as counter-measures. {\textcopyright} 2021 System Dynamics Society

}, doi = {https://doi.org/10.1002/sdr.1672}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/sdr.1672}, author = {Sahin, {\"O}zge and Feyyaz {\c S}ent{\"u}rk and Yaman Barlas and Yasarcan, Hakan} } @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 {1473, title = {Profitable Decarbonization through E-Mobility}, journal = {Energies}, volume = {13}, year = {2020}, abstract = {

This paper focuses on the interdependent relationship of power generation, transportation and CO2 emissions to evaluate the impact of electric vehicle deployment on power generation and CO2 emissions. The value of this evaluation is in the employment of a large-scale, bottom-up, national energy modeling system that encompasses the complex relationships of producing, transforming, transmitting and supplying energy to meet the useful demand characteristics with great technological detail. One of such models employed in this analysis is the BUEMS model. The BUEMS model provides evidence of win-win policy options that lead to profitable decarbonization using Turkey{\textquoteright}s data in BUEMS. Specifically, the result shows that a ban on diesel fueled vehicles reduces lifetime emissions as well as lifetime costs. Furthermore, model results highlight the cost-effective emission reduction potential of e-buses in urban transportation. More insights from the results indicate that the marginal cost of emission reduction through e-bus transportation is much lower than that through other policy measures such as carbon taxation in transport. This paper highlights the crucial role the electricity sector plays in the sustainability of e-mobility and the value of related policy prescriptions.

}, issn = {1996-1073}, doi = {10.3390/en13164042}, url = {https://www.mdpi.com/1996-1073/13/16/4042}, author = {G{\"u}rkan Kumbaro{\u g}lu and Canaz, Cansu and Deason, Jonathan and Shittu, Ekundayo} } @article {1448, title = {The r-interdiction selective multi-depot vehicle routing problem}, journal = {International Transactions in Operational Research}, volume = {27}, year = {2020}, pages = {835-866}, abstract = {

Abstract The protection of critical facilities has been attracting increasing attention in the past two decades. Critical facilities involve physical assets such as bridges, railways, power plants, hospitals, and transportation hubs among others. In this study we introduce a bilevel optimization problem for the determination of the most critical depots in a vehicle routing context. The problem is modeled as an attacker{\textendash}defender game (Stackelberg game) from the perspective of an adversary agent (the attacker) who aims to inflict maximum disruption on a routing network. We refer to this problem as the r-interdiction selective multi-depot vehicle routing problem (RI-SMDVRP). The attacker is the decision maker in the upper level problem (ULP) who chooses r depots to interdict with certainty. The defender is the decision maker in the lower level problem (LLP) who optimizes the vehicle routes in the wake of the attack. The defender has to satisfy all customer demand either using the remaining depots or through outsourcing to a third party logistics service provider. The ULP is solved through exhaustive enumeration, which is viable when the cardinality of interdictions does not exceed five among nine depots. For the LLP we implement a tabu search heuristic adapted to the selective multi-depot VRP. Our results are obtained on a set of RI-SMDVRP instances synthetically constructed from standard MDVRP test instances.

}, keywords = {bilevel programming, interdiction, multi-depot vehicle routing problem, outsourcing, tabu search}, doi = {https://doi.org/10.1111/itor.12669}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1111/itor.12669}, author = {Sadati, Mir Ehsan Hesam and Aksen, Deniz and Necati Aras} } @article {1456, title = {Statistical inference using stratified judgment post-stratified samples from finite populations}, journal = {Environmental and Ecological Statistics}, volume = {27}, year = {2020}, pages = {73{\textendash}94}, author = {Ozturk, Omer and K{\"o}n{\"u}l Bayramo{\u g}lu Kavlak} } @article {1427, title = {A strong integer programming formulation for hybrid flowshop scheduling}, journal = {Journal of the Operational Research Society}, volume = {71}, year = {2020}, pages = {2042-2052}, doi = {10.1080/01605682.2019.1654414}, url = {https://doi.org/10.1080/01605682.2019.1654414}, author = {Ali Tamer {\"U}nal and Semra A{\u g}ral{\i} and Z C Ta{\c s}k{\i}n} } @article {1447, title = {A trilevel r-interdiction selective multi-depot vehicle routing problem with depot protection}, journal = {Computers \& operations research}, volume = {123}, year = {2020}, pages = {104996}, author = {Sadati, Mir Ehsan Hesam and Aksen, Deniz and Necati Aras} } @article {1439, title = {Assignment problem with conflicts}, journal = {Computers \& Operations Research}, volume = {111}, year = {2019}, pages = {214-229}, abstract = {

We focus on an extension of the assignment problem with additional conflict (pair) constraints in conjunction with the assignment constraints and binary restrictions. Given a bipartite graph with a cost associated with each edge and a conflict set of edge pairs, the assignment problem with conflict constraints corresponds to finding a minimum weight perfect matching without any conflicting edge pair. For example, some chemicals cannot be processed on close processors, food and toxic products cannot be stored neighboring locations at the same storage area, and machines cannot be sent to process jobs without satisfying some spatial constraints. Unlike the well-known assignment problem, this problem is NP-hard. We first introduce a realistic special class and demonstrate its polynomial solvability. Then, we propose a Branch-and-Bound algorithm and a Russian Doll Search algorithm using the assignment problem relaxations for lower bound computations, and introduce combinatorial branching rules based on the conflicting edges in an optimal solution of the relaxations. According to the extensive computational experiments we can say that the proposed algorithms are very efficient.

}, keywords = {Assignment problem, Branch-and-bound, Conflicts, integer programming}, issn = {0305-0548}, doi = {https://doi.org/10.1016/j.cor.2019.07.001}, url = {https://www.sciencedirect.com/science/article/pii/S0305054819301777}, author = {Temel {\"O}ncan and Zeynep {\c S}uvak and M. Hakan Aky{\"u}z and I. Kuban Altinel} } @article {1440, title = {Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem}, journal = {Annals of Operations Research}, volume = {279}, year = {2019}, pages = {1{\textendash}42}, author = {Aky{\"u}z, M Hakan and {\"O}ncan, Temel and I. Kuban Altinel} } @article {1415, title = {Classification of generic system dynamics model outputs via supervised time series pattern discovery}, journal = {Turkish Journal of Electrical Engineering \& Computer Sciences}, volume = {27}, year = {2019}, pages = {832{\textendash}846}, author = {Edali, Mert and Mustafa Gokce Baydogan and G{\"o}nen{\c c} Y{\"u}cel} } @article {1433, title = {A column generation heuristic for {VMAT} planning with adaptive {CVaR} constraints}, journal = {Physics in Medicine {\&} Biology}, volume = {64}, year = {2019}, month = {oct}, pages = {205024}, abstract = {

In this study we develop an efficient computational procedure that generates medically acceptable treatment plans for volumetric modulated arc therapy with constant gantry speed. Our proposed method is a column generation heuristic based on a mixed integer linear programming model, where the objective function contains minimization of total monitor unit of the treatment plan and dose-volume requirements are included as conditional value-at-risk constraints. Our heuristic generates a full treatment arc for the restricted master problem and calibrates the right hand side parameters of the conditional value-at-risk constraints in the first phase. In the second phase, this initial solution is improved by performing column generation. This is a fully automated procedure and produces treatment plans in a single call without any human intervention. We evaluate its performance on real prostate cancer data by comparing the quality of the generated plans with those obtained by a widely used commercial treatment planning system. Our analysis shows that the results are promising, and the generated plans satisfy the prescription restrictions and require fewer monitor units on average compared to the ones obtained using Eclipse.

}, doi = {10.1088/1361-6560/ab416e}, url = {https://doi.org/10.1088/1361-6560/ab416e}, author = {P{\i}nar Dursun and Z C Ta{\c s}k{\i}n and I. Kuban Altinel and Hatice Bilge and Nazmiye D{\"o}nmez Kesen and Murat Okutan and Ethem Nezih Oral} } @article {1431, title = {A decomposition approach to solve the selective graph coloring problem in some perfect graph families}, journal = {Networks}, volume = {73}, year = {2019}, pages = {145-169}, abstract = {

Graph coloring is the problem of assigning a minimum number of colors to all vertices of a graph such that no two adjacent vertices receive the same color. The selective graph coloring problem is a generalization of the standard graph coloring problem; given a graph with a partition of its vertex set into clusters, the objective is to choose exactly one vertex per cluster so that, among all possible selections, the number of colors necessary to color the vertices in the selection is minimum. This study focuses on a decomposition based exact solution framework for selective coloring in some perfect graph families: in particular, permutation, generalized split, and chordal graphs where the selective coloring problem is known to be NP-hard. Our method combines integer programming techniques and combinatorial algorithms for the graph classes of interest. We test our method on graphs with different sizes and densities, present computational results and compare them with solving an integer programming formulation of the problem by CPLEX, and a state-of-the art algorithm from the literature. Our computational experiments indicate that our decomposition approach significantly improves solution performance in low-density graphs, and regardless of edge-density in the class of chordal graphs.

}, keywords = {chordal graphs, decomposition algorithm, generalized split graphs, integer programming, partition coloring, permutation graphs, selective graph coloring}, doi = {https://doi.org/10.1002/net.21850}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21850}, author = {{\c S}eker, Oylum and Ekim, Tinaz and Z C Ta{\c s}k{\i}n} } @article {1432, title = {The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT)}, journal = {European Journal of Operational Research}, volume = {272}, year = {2019}, pages = {372-388}, abstract = {

The success of radiation therapy depends on the ability to deliver the proper amount of radiation to cancerous cells while protecting healthy tissues. As a natural consequence, any new treatment technology improves quality standards concerning primarily this issue. Similar to the widely used Intensity Modulated Radiation Therapy (IMRT), the radiation resource is outside of the patient{\textquoteright}s body and the beam is shaped by a multi-leaf collimator mounted on the linear accelerator{\textquoteright}s head during the state-of-the-art Volumetric Modulated Arc Therapy (VMAT) as well. However, unlike IMRT, the gantry of the accelerator may rotate along one or more arcs and deliver radiation continuously. This property makes VMAT powerful in obtaining high conformal plans in terms of dose distribution; but the apertures are interdependent and optimal treatment planning problem cannot be decomposed into simpler independent subproblems as a consequence. In this work, we consider optimal treatment planning problem for VMAT. First, we formulate a mixed-integer linear program minimizing total radiation dose intensity subject to clinical requirements embedded within the constraints. Then, we develop efficient solution procedures combining Benders decomposition with certain acceleration strategies. We investigate their performance on a large set of test instances obtained from an anonymous real prostate cancer data.

}, keywords = {algorithms, Benders decomposition, integer programming, Radiation therapy, VMAT}, issn = {0377-2217}, doi = {https://doi.org/10.1016/j.ejor.2018.06.023}, url = {https://www.sciencedirect.com/science/article/pii/S0377221718305514}, author = {P{\i}nar Dursun and Z C Ta{\c s}k{\i}n and I. Kuban Altinel} } @article {1501, title = {Edge-stable equimatchable graphs}, journal = {Discrete Applied Mathematics}, volume = {261}, year = {2019}, pages = {136-147}, abstract = {

A graph G is equimatchable if every maximal matching of G has the same cardinality. We are interested in equimatchable graphs such that the removal of any edge from the graph preserves the equimatchability. We call an equimatchable graph G edge-stable if G\e, that is the graph obtained by the removal of edge e from G, is also equimatchable for any e∈E(G). After noticing that edge-stable equimatchable graphs are either 2-connected factor-critical or bipartite, we characterize edge-stable equimatchable graphs. This characterization yields an O(min(n3.376,n1.5m)) time recognition algorithm. Lastly, we introduce and shortly discuss the related notions of edge-critical, vertex-stable and vertex-critical equimatchable graphs. In particular, we emphasize the links between our work and the well-studied notion of shedding vertices, and point out some open questions.

}, keywords = {1-well-covered, Edge-criticality, Edge-stability, Maximal matching, Shedding vertex}, issn = {0166-218X}, doi = {https://doi.org/10.1016/j.dam.2018.09.033}, url = {https://www.sciencedirect.com/science/article/pii/S0166218X18305158}, author = {Zakir Deniz and Ekim, Tinaz} } @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 {1416, title = {Exploring the behavior space of agent-based simulation models using random forest metamodels and sequential sampling}, journal = {Simulation Modelling Practice and Theory}, volume = {92}, year = {2019}, pages = {62-81}, abstract = {

Agent-based modeling is an effective way of understanding and analyzing complex adaptive phenomena. In this respect, discovering the relationship between inputs and outputs of agent-based models is the ultimate way of providing insights into understanding the dynamics of the system being modeled. Therefore, there are many approaches in the literature to clarify these relationships including sampling and metamodeling. Emphasizing the weaknesses and disadvantages of current methods, we present a metamodel-guided sequential sampling technique which combines random forests and uncertainty sampling. Experimental results on two well-known agent-based models show that the presented technique yields metamodels of higher accuracy compared to metamodels trained with randomly selected input{\textendash}output data. Contrary to the previous studies emphasizing only the improvement in the metamodel accuracy, we also focus on input parameter combinations selected by the sequential sampling technique, and we observe that sequential sampling is able to capture the boundaries of tipping point behaviors as well as the points exhibiting counter-intuitive behavior, thus, potentially aiding verification, validation, and understanding of agent-based models. Additionally, we propose a novel two-step method for the categorization of the agent-based model outputs prior to metamodel training, which helps the analyst to decide on whether preserving numerical model outputs or continuing the metamodel training procedure with qualitative categorical agent-based model outputs.

}, keywords = {Active learning, Agent-based modeling, Metamodeling, Output categorization, Random forest, Sequential sampling}, issn = {1569-190X}, doi = {https://doi.org/10.1016/j.simpat.2018.12.006}, url = {https://www.sciencedirect.com/science/article/pii/S1569190X18301941}, author = {Mert Edali and G{\"o}nen{\c c} Y{\"u}cel} } @article {1437, title = {Influence maximization with deactivation in social networks}, journal = {European Journal of Operational Research}, volume = {278}, year = {2019}, pages = {105-119}, abstract = {

In this paper, we consider an extension of the well-known Influence Maximization Problem in a social network which deals with finding a set of k nodes to initiate a diffusion process so that the total number of influenced nodes at the end of the process is maximized. The extension focuses on a competitive variant where two decision makers are involved. The first one, the leader, tries to maximize the total influence spread by selecting the most influential nodes and the second one, the follower, tries to minimize it by deactivating some of these nodes. The formulated bilevel model is solved by complete enumeration for small-sized instances and by a matheuristic for large-sized instances. In both cases, the lower level problem, which is a stochastic optimization problem, is approximated via the Sample Average Approximation method.

}, keywords = {Bilevel modeling, Influence maximization, Matheuristics, Metaheuristics, Stochastic optimization}, issn = {0377-2217}, doi = {https://doi.org/10.1016/j.ejor.2019.04.010}, url = {https://www.sciencedirect.com/science/article/pii/S0377221719303303}, author = {K{\"u}bra Tan{\i}nm{\i}{\c s} and Necati Aras and I. Kuban Altinel} } @article {1444, title = {An integrated disaster preparedness model for retrofitting and relief item transportation}, journal = {Networks and Spatial Economics}, volume = {19}, year = {2019}, pages = {1031{\textendash}1068}, author = {D{\"o}yen, Alper and Necati Aras} } @article {1434, title = {Minimum cost noncrossing flow problem on layered networks}, journal = {Discrete Applied Mathematics}, volume = {261}, year = {2019}, pages = {2-21}, abstract = {

In this work we focus on an extension of the minimum cost flow problem in layered networks. Feasible arc flows must satisfy a specific compatibility restriction in addition to flow balance and capacity restrictions. Namely, at most one of the crossing arcs is allowed to have positive flow on it. This variant of the minimum cost flow problem, which we call the minimum cost noncrossing flow problem, can frequently be encountered in real life. The determination of optimal temporal quay crane allocations to berthed vessels in container terminals, and optimal train schedules through the stations on the same railroad line are two examples. We first analyze the complexity of the problem and show that the noncrossing flow problem is in fact NP-complete in a layered network. Then, we introduce mixed-integer linear programming formulations and discuss a polynomially solvable special case. Next we show a sufficient condition for the existence of a crossing in an optimal solution, which can be used for preprocessing the arcs in order to reduce the problem size. Our computational experiments on a large test set show that our preprocessing algorithm can significantly reduce the number of arcs.

}, keywords = {integer programming, Layered networks, Network flows, Noncrossing flow}, issn = {0166-218X}, doi = {https://doi.org/10.1016/j.dam.2018.09.016}, url = {https://www.sciencedirect.com/science/article/pii/S0166218X18304815}, author = {I. Kuban Altinel and Necati Aras and Zeynep {\c S}uvak and Z C Ta{\c s}k{\i}n} } @article {1430, title = {Optimization{\textendash}based decoding algorithms for LDPC convolutional codes in communication systems}, journal = {IISE Transactions}, volume = {51}, year = {2019}, pages = {1061-1074}, abstract = {

AbstractIn a digital communication system, information is sent from one place to another over a noisy communication channel. It may be possible to detect and correct errors that occur during the transmission if one encodes the original information by adding redundant bits. Low{\textendash}Density Parity{\textendash}Check (LDPC) convolutional codes, a member of the LDPC code family, encode the original information to improve error correction capability. In practice these codes are used to decode very long information sequences, where the information arrives in subsequent packets over time, such as video streams. We consider the problem of decoding the received information with minimum error from an optimization point of view and investigate integer programming{\textendash}based exact and heuristic decoding algorithms for its solution. In particular, we consider relax{\textendash}and{\textendash}fix heuristics that decode information in small windows. Computational results indicate that our approaches identify near{\textendash}optimal solutions significantly faster than a commercial solver in high channel error rates. Our proposed algorithms can find higher quality solutions compared with the state of the art iterative decoding heuristic.

}, doi = {10.1080/24725854.2018.1550692}, url = {https://doi.org/10.1080/24725854.2018.1550692}, author = {Banu Kabakulak and Z C Ta{\c s}k{\i}n and Ali Emre Pusane} } @article {1487, title = {Periodic Due Date Assignment with Family Setups}, journal = {INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE}, volume = {26}, year = {2019}, pages = {0{\textendash}0}, issn = {-}, author = {Sertdemir, Sevilay and Ali Tamer {\"U}nal and D{\"U}ZG{\.I}T, ZEHRA} } @article {1438, title = {Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms}, journal = {European Journal of Operational Research}, volume = {277}, year = {2019}, pages = {62-83}, abstract = {

A rectangle blanket is a set of non-overlapping axis-aligned rectangles, used to approximately represent the two-dimensional image of a shape. The use of a rectangle blanket is a widely considered strategy for speeding-up the computations in many computer vision applications. Since neither the rectangles nor the image have to be fully covered by the other, the blanket becomes more precise as the non-overlapping area of the image and the blanket decreases. In this work, we focus on the rectangle blanket problem, which involves the determination of an optimum blanket minimizing the non-overlapping area with a given image subject to an upper bound on the total number of rectangles the blanket can include. This problem has similarities with rectangle covering, rectangle partitioning and cutting/packing problems. The image replaces an irregular master object by an approximating set of smaller axis-aligned rectangles. The union of these rectangles, namely, the rectangle blanket, is neither restricted to remain entirely within the master object, nor required to cover the master object completely. We first develop a binary integer linear programming formulation of the problem. Then, we introduce four methods for its solution. The first one is a branch-and-price algorithm that computes an exact optimal solution. The second one is a new constrained simulated annealing heuristic. The last two are heuristics adopting ideas available in the literature for other computer vision related problems. Finally, we realize extensive computational tests and report results on the performances of these algorithms.

}, keywords = {Branch-and-price, Computer vision, Cutting /Packing, Heuristics, integer programming}, issn = {0377-2217}, doi = {https://doi.org/10.1016/j.ejor.2019.02.004}, url = {https://www.sciencedirect.com/science/article/pii/S0377221719301158}, author = {Bar{\i}{\c s} Evrim Demir{\"o}z and I. Kuban Altinel and Lale Akarun} } @article {1445, title = {SLA-aware optimal resource allocation for service-oriented networks}, journal = {Future Generation Computer Systems}, volume = {101}, year = {2019}, pages = {959-974}, abstract = {

The popularity of traditional network services and web content is succeeded by the recent trend in customized services proliferated by the smart devices and gadgets. Fall-risk assessment, augmented reality, ECG (electrocardiography) monitoring, virtual reality-based gaming and similar services are driven through data generated by multi-modal sensors embedded in the end-user equipment. These services may possess varying characteristics and requirements represented with performance metrics and Quality of Service (QoS) parameters. Even though the small form-factor end-user gadgets are getting powerful in terms of resource capacity, they are still incapable of executing complex routines, and thus these tasks should be offloaded to a remote machine. Service-Centric Networks (SCN) focus on delivering customized services to the users in a location-independent fashion. This is in parallel with previous vision put forward by the Information-Centric Networks (ICN) and Content Delivery Networks (CDN), which aim to enhance the end-user experience. The novel set of services for complementing the daily activities of the end-users mostly depicts a latency-intolerant attribute which ultimately calls for a full-fledged resource allocation scheme. Within this context, both computation and networking resources should be allocated optimally, and task assignments should be handled precisely for following the requirements specified by the Service Level Agreements (SLAs). This paper initially presents and discusses problem definitions that should be addressed by the service-centric multi-tier computing architecture that is composed of edge, metro, and cloud servers. In order to achieve this objective, an SLA-aware optimal resource allocation and task assignment model for service-oriented networks is proposed. This optimization model is based on a nonlinear delay formulation for accommodating service-centric network scenarios under various conditions. It is then reshaped as a mixed-integer linear model through piecewise linear approximation. Additionally, a heuristic implementation is presented to address the time and space complexities of the problem for which the aforementioned optimization models remain ineffective. Performance evaluation results show that the proposed solutions are able to find a good allocation of resources while taking the requirements of the services into account.

}, keywords = {Cloud computing, Edge computing, Network optimization, Service-centric networks, Task offloading}, issn = {0167-739X}, doi = {https://doi.org/10.1016/j.future.2019.07.050}, url = {https://www.sciencedirect.com/science/article/pii/S0167739X19306430}, author = {Ahmet Cihat Bakt{\i}r and Bet{\"u}l Ahat and Necati Aras and Atay {\"O}zg{\"o}vde and Cem Ersoy} } @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 {1429, title = {Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT)}, journal = {Computers \& Operations Research}, volume = {110}, year = {2019}, pages = {1-17}, abstract = {

Volumetric Modulated Arc Therapy (VMAT) is the state-of-the-art technique for external radiation therapy treatment. In this method, radiation can be delivered continuously on one or more arcs during the rotation of the gantry of the linear accelerator. This property makes VMAT powerful in obtaining high conformal plans in terms of dose distribution within short treatment times. However, the apertures composed by the leaves of the multileaf collimator (MLC) system that shapes continuously the radiation are interdependent, which makes treatment planning hard. We propose a mixed integer linear programming model for VMAT planning problem and exact branch-and-price algorithms to solve it. The objective of the model is to minimize total radiation that is delivered to the patient, and pricing subproblem is decomposable by rows of the MLC and can be solved as a shortest path problem. We generate a large set of test instances from a real data set and evaluate the performance of the proposed branch-and-price algorithm. Computational results reveal that new algorithms are efficient and capable of finding optimal solutions for large problem instances.

}, keywords = {Branch-and-price, Column generation, integer programming, Radiation therapy, Shortest path problem, VMAT}, issn = {0305-0548}, doi = {https://doi.org/10.1016/j.cor.2019.05.018}, url = {https://www.sciencedirect.com/science/article/pii/S0305054819301315}, author = {P{\i}nar Dursun and Z C Ta{\c s}k{\i}n and I. Kuban Altinel} } @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 {1414, title = {Automated Analysis of Regularities Between Model Parameters and Output Using Support Vector Regression in Conjunction with Decision Trees}, journal = {Journal of Artificial Societies and Social Simulation}, volume = {21}, year = {2018}, pages = {1}, abstract = {

Opening the black-box of nonlinear relationships between model inputs and outputs, significantly contributes to the understanding of the dynamic problem being studied. Considering the weaknesses and disadvantages of human-guided and systematic techniques offered in the literature, this paper presents a model analysis and exploration tool for agent-based models. The tool first approximates input-output relationships by developing a metamodel, a simplified representation of the original agent-based model. For this purpose, it utilizes support vector regression, which is capable of approximating highly nonlinear systems accurately. Following metamodel fitting, the tool incorporates a tree-based method to extract knowledge embedded in the metamodel. The resulting tree is then expressed as a set of IF-THEN rules that have high comprehensibility compared to complex metamodel function. We utilized the tool for the exploration of Traffic Basic model and the results show the relationship between model input and output. Furthermore, rules extracted from the metamodel point out certain counter-intuitive results of the model which are not easily inferred from the raw input-output data. We also discuss potential uses of our tool and provide the R script which makes the analysis repeatable for other agent-based models.

}, keywords = {decision tree, MetaModel, R, Rule Extraction, Support Vector Regression, Traffic}, issn = {1460-7425}, doi = {10.18564/jasss.3786}, url = {http://jasss.soc.surrey.ac.uk/21/4/1.html}, author = {Edali, Mert and G{\"o}nen{\c c} Y{\"u}cel} } @article {1157, title = {Autoregressive forests for multivariate time series modeling}, journal = {Pattern Recognition}, volume = {73}, year = {2018}, pages = {202 - 215}, keywords = {Classification, Ensemble learning, Multivariate time series, Time series representation, Vector autoregression}, issn = {0031-3203}, doi = {https://doi.org/10.1016/j.patcog.2017.08.016}, url = {http://www.sciencedirect.com/science/article/pii/S0031320317303291}, author = {Kerem Sinan Tuncel and Mustafa Gokce Baydogan} } @inbook {1451, title = {Credibility, Validity and Testing of Dynamic Simulation Models}, booktitle = {Simulation and Modeling Methodologies, Technologies and Applications}, year = {2018}, publisher = {Springer International Publishing}, organization = {Springer International Publishing}, address = {Cham}, abstract = {

Also called {\textquoteleft}model validity{\textquoteright} testing, model credibility evaluation has always been a controversial issue in any modeling methodology. We briefly discuss why this important notion is so controversial. To this end, we classify major types of models, particularly as they impact the notion of model credibility: i- Purely statistical forecasting (black box) models, and ii- Causal-descriptive policy (transparent) models. We then focus on what makes causal-descriptive model credibility and evaluation unique and quite difficult, compared to short-term forecasting models. One important result is that causal-descriptive model credibility consists of two different aspects: structural and behavioral. In most simulation modeling (particularly system dynamics policy simulation), establishing structure credibility must strictly precede behavior credibility; the latter has no value without the former. We thus discuss Structural tests and output behavior tests for dynamic simulation models separately. Structure tests can further be classified into direct and indirect structure tests. We place special emphasis on indirect structure tests. We also provide a quick overview of recent model testing software developed in SESDYN Laboratory at Bo{\u g}azi{\c c}i University. Finally we discuss model credibility in broader context and some implementation issues.

}, isbn = {978-3-319-69832-8}, author = {Yaman Barlas} } @article {1443, title = {Determining the most vulnerable components in a transportation network}, journal = {Sigma}, volume = {9}, year = {2018}, pages = {371{\textendash}382}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, Hande and Necati Aras} } @article {1161, title = {Efficient simulations for a Bernoulli mixture model of portfolio credit risk}, journal = {Annals of Operations Research}, volume = {260}, year = {2018}, pages = {113{\textendash}128}, author = {Ba{\c s}o{\u g}lu, {\.I}smail and Wolfgang H{\"o}rmann and Sak, Halis} } @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 {1504, title = {Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II}, journal = {Discrete Mathematics and Theoretical Computer Science}, volume = {20}, year = {2018}, pages = {1b{\textendash}1b}, author = {Boyac{\i}, Arman and Ekim, Tinaz and Shalom, Mordechai and Zaks, Shmuel} } @article {1474, title = {Impacts of Regulatory Transformation Processes to the Downstream Oil Market in Turkey}, journal = {International Journal of Energy Economics and Policy}, volume = {8}, year = {2018}, pages = {141{\textendash}149}, issn = {2146-4553}, author = {Metin, Erol and G{\"u}rkan Kumbaro{\u g}lu} } @article {1435, title = {Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem}, journal = {INFORMS Journal on Computing}, volume = {30}, year = {2018}, pages = {43-56}, abstract = {

We investigate the maximum induced matching problem (MIM), which is the problem of finding an induced matching having the largest cardinality on an undirected graph. The problem is known to be NP-hard for general graphs. We first propose a vertex-based integer programming formulation for MIM, which is more compact compared to an edge-based formulation found in the literature. We also introduce the maximum weight induced matching problem (MWIM), which generalizes MIM so that vertices and edges have weights. We adapt the edge-based formulation to MWIM, and propose a quadratic programming formulation of MWIM based on our vertex-based formulation. We then linearize our quadratic programming formulation, and devise a Benders decomposition algorithm that exploits a special structure of the linearized formulation. We also propose valid inequalities and formulation tightening procedures to improve the efficiency of our approach. Our computational tests on a large suite of randomly generated graphs show that our vertex-based formulation and decomposition approach significantly improve the solvability of MIM and MWIM, especially on dense graphs. The online appendix and data are available at https://doi.org/10.1287/ijoc.2017.0764.

}, doi = {10.1287/ijoc.2017.0764}, url = {https://doi.org/10.1287/ijoc.2017.0764}, author = {Ahat, Bet{\"u}l and Ekim, Tinaz and Z C Ta{\c s}k{\i}n} } @article {1502, title = {The maximum cardinality cut problem in co-bipartite chain graphs}, journal = {Journal of Combinatorial Optimization}, volume = {35}, year = {2018}, month = {Jan}, pages = {250{\textendash}265}, issn = {1382-6905}, author = {Ekim, Tinaz and Boyac{\i}, Arman and Shalom, Mordechai} } @article {1457, title = {Model based inference using ranked set samples}, journal = {Survey Methodology}, volume = {44}, year = {2018}, month = {Jun}, pages = {1{\textendash}16}, issn = {0714-0045}, author = {Ozturk, Omer and K{\"o}n{\"u}l Bayramo{\u g}lu Kavlak} } @article {1493, title = {The moderating impact of supply network topology on the effectiveness of risk management}, journal = {International Journal of Production Economics}, volume = {197}, year = {2018}, pages = {13-26}, abstract = {

While supply chain risk management offers a rich toolset for dealing with risk at the dyadic level, less attention has been given to the effectiveness of risk management in complex supply networks. We bridge this gap by building an agent based model to explore the relationship between topological characteristics of complex supply networks and their ability to recover through inventory mitigation and contingent rerouting. We simulate upstream supply networks, where each agent represents a supplier. Suppliers{\textquoteright} connectivity patterns are generated through random and preferential attachment models. Each supplier manages its inventory using an anchor-and-adjust ordering policy. We then randomly disrupt suppliers and observe how different topologies recover when risk management strategies are applied. Our results show that topology has a moderating effect on the effectiveness of risk management strategies. Scale-free supply networks generate lower costs, have higher fill-rates, and need less inventory to recover when exposed to random disruptions than random networks. Random networks need significantly more inventory distributed across the network to achieve the same fill rates as scale-free networks. Inventory mitigation improves fill-rate more than contingent rerouting regardless of network topology. Contingent rerouting is not effective for scale-free networks due to the low number of alternative suppliers, particularly for short-lasting disruptions. We also find that applying inventory mitigation to the most disrupted suppliers is only effective when the network is exposed to frequent disruptions; and not cost effective otherwise. Our work contributes to the emerging field of research on the relationship between complex supply network topology and resilience.

}, keywords = {Agent-based modelling, Complex supply networks, Contingent rerouting, Inventory mitigation, Random networks, Scale-free networks, Supply chain risk management}, issn = {0925-5273}, doi = {https://doi.org/10.1016/j.ijpe.2017.12.013}, url = {https://www.sciencedirect.com/science/article/pii/S092552731730419X}, author = {Anna Ledwoch and Yasarcan, Hakan and Alexandra Brintrup} } @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 {1450, title = {Queuing systems in a feedback environment: Continuous versus discrete-event simulation}, journal = {Journal of Simulation}, volume = {12}, year = {2018}, pages = {144-161}, abstract = {

AbstractThe discrete stochastic nature of typical queuing problems calls for discrete-event simulation, rather than continuous simulation that would ignore the discrete details that may be important in queuing dynamics. However, continuous simulation can perhaps be suitable for certain large queuing systems that involve feedback interactions and time delays. This study examines this question by a series of simulation experiments with queuing systems. We start with an M/M/2 system with state-dependent arrivals. Since continuous simulation represents the system states by continuous variables, when these variables (number of entities) revolve around small integer values, discrete and continuous simulation approaches exhibit significant differences in their output dynamics. However, when the system scale is increased (many servers, many entities), errors caused by continuity assumption drop significantly and the two simulation approaches yield much closer outputs. Finally, when a delay is introduced before the state of the system influences the arrival rates, the system behaviour becomes oscillatory, involving even sustained oscillations when the delay is discrete. We show that in such settings, continuous simulation can be superior to discrete simulation, since the system exhibits far-from-equilibrium dynamics driven by the endogenous system structure, rather than by discrete stochastic events. Our results have various real-life modelling implications.

}, doi = {10.1080/17477778.2018.1465153}, url = {https://doi.org/10.1080/17477778.2018.1465153}, author = {Yaman Barlas and Onur {\"O}zg{\"u}n} } @article {1442, title = {Robust supply chain network design with multi-products for a company in the food sector}, journal = {Applied Mathematical Modelling}, volume = {60}, year = {2018}, pages = {526-539}, abstract = {

The paper aims to solve a problem faced by a company competing in the snacks market in Turkey. In line with the growth in this market, the company needs to make important decisions over the next few years about the timing and location of a new plant, its initial capacity, the timing and amount of additional capacity to be installed at the new and existing plants, the assignment of demand points to plants and the amount of raw materials to be shipped from suppliers to the plants in each period. The objective is to minimize the total cost of various components. The problem is formulated as a multi-period supply chain network design model with multi products. The resulting mixed-integer linear programming model is solved by the commercial solver CPLEX. This model enables us to carry out all analyses requested by the company in an efficient way. After this deterministic model is solved on the basis of a 9\% annual increase in demand, it is extended to a minimax regret model to deal with uncertainty in demand quantities. The results suggest that opening the new plant in the city of {\.I}zmir is indeed a robust solution that is unaffected in different scenarios that are based on three distinct demand increase rates. Even though the location of the new plant remains unchanged with respect to scenarios, the optimal robust solution differs from the optimal solution of each scenario in terms of the capacity expansion decisions. After all obtained results had been communicated to the company managers and executives, the new plant construction was started in 2016 very close to the city that the mathematical model had determined. The new plant is expected to start operating in 2018.

}, keywords = {Demand uncertainty, Facility location-allocation, Mixed-integer linear programming, Robust optimization, Supply chain network design}, issn = {0307-904X}, doi = {https://doi.org/10.1016/j.apm.2018.03.034}, url = {https://www.sciencedirect.com/science/article/pii/S0307904X18301586}, author = {Necati Aras and {\"U}mit Bilge} } @article {1475, title = {Substitution elasticities in an energy-augmented CES production function An empirical analysis for Turkey}, journal = {Journal of Economics and Political Economy}, volume = {5}, year = {2018}, month = {Jun}, pages = {234{\textendash}249}, issn = {2148-8347}, author = {K{\"u}{\c c}{\"u}k, Merve and G{\"u}rkan Kumbaro{\u g}lu and SARICA, KEMAL} } @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} } @inbook {1186, title = {Bilevel Models on the Competitive Facility Location Problem}, booktitle = {Spatial Interaction Models}, year = {2017}, pages = {1{\textendash}19}, publisher = {Springer}, organization = {Springer}, author = {Necati Aras and K{\"u}{\c c}{\"u}kayd{\i}n, Hande} } @article {1130, title = {Branch-cut-price algorithms for solving a class of search problems on general graphs}, journal = {Networks}, volume = {70}, year = {2017}, pages = {4-18}, doi = {http://doi.org/10.1002/net.21740}, author = {Z C Ta{\c s}k{\i}n and J. Cole Smith} } @article {1507, title = {Complexity of the Improper Twin Edge Coloring of Graphs}, journal = {Graphs and Combinatorics}, volume = {33}, year = {2017}, pages = {595{\textendash}615}, author = {Abedin, Paniz and Akbari, Saieed and Demange, Marc and Ekim, Tinaz} } @article {1164, title = {Designing distribution systems with reverse flows}, journal = {Journal of Remanufacturing}, volume = {7}, year = {2017}, pages = {113{\textendash}137}, author = {Tombu{\c s}, Ay{\c s}e Cilac{\i} and Necati Aras and Verter, Vedat} } @proceedings {1180, title = {Edge extremal Graphs Under Degree and Matching Number Restrictions}, journal = {17th Haifa Workshop on Interdisciplinary Applications of Graphs {\textendash} CRI}, year = {2017}, author = {Ekim, Tinaz} } @article {1494, title = {Effect of Lead Time on Anchor-and-Adjust Ordering Policy in Continuous Time Stock Control Systems}, journal = {Korean System Dynamics Review}, volume = {2}, year = {2017}, month = {Jun}, pages = {65{\textendash}85}, author = {Mutallip, Ahmet and Yasarcan, Hakan} } @article {1090, title = {Employee Scheduling in Service Industries with Flexible Employee Availability and Demand}, journal = {Omega}, volume = {66}, year = {2017}, pages = {159-169}, doi = {http://dx.doi.org/10.1016/j.omega.2016.03.001}, author = {Semra A{\u g}ral{\i} and Z C Ta{\c s}k{\i}n and Ali Tamer {\"U}nal} } @proceedings {1182, title = {Ergonomics in design: Safety and user experience factors}, journal = {2nd International Conference on Design and Production Engineering}, year = {2017}, author = {Mahmut Ek{\c s}io{\u g}lu} } @proceedings {1181, title = {The Impact of Orbit Dependent Return Rate on the Control Policies of a Hybrid Production System}, journal = {11th SMMSO Conference }, year = {2017}, author = {Aybek Korugan and S. Ata and M. Fad{\i}lo{\u g}lu} } @article {1159, title = {Influence maximization based on partial network structure information: A comparative analysis on seed selection heuristics}, journal = {International Journal of Modern Physics C}, volume = {28}, year = {2017}, pages = {1750122}, author = {{\c S}irag Erkol and G{\"o}nen{\c c} Y{\"u}cel} } @article {1166, title = {Karbon Vergisi ile Sera Gaz{\i} Emisyonlar{\i}n{\i}n Azalt{\i}m{\i}: Turkiye Vakas{\i}.}, journal = {International Relations/Uluslararasi Iliskiler}, volume = {14}, year = {2017}, author = {G{\"u}rkan Kumbaro{\u g}lu and {\.I}lhan Or and I{\c S}IK, Mine} } @conference {1185, title = {Linear-Time Generation of Random Chordal Graphs}, booktitle = {International Conference on Algorithms and Complexity}, year = {2017}, publisher = {Springer}, organization = {Springer}, author = {Oylum {\c S}eker and Pinar Heggernes and Ekim, Tinaz and Z. Caner Ta{\c s}k{\i}n} } @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 {1179, title = {Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded}, journal = {Discrete Mathematics}, volume = {340}, year = {2017}, pages = {927 - 934}, keywords = {Claw-free graphs, Edge-extremal graphs, Maximum matching, Ramsey theory}, issn = {0012-365X}, doi = {https://doi.org/10.1016/j.disc.2017.01.010}, url = {http://www.sciencedirect.com/science/article/pii/S0012365X17300109}, author = {Cemil Dibek and Ekim, Tinaz and Pinar Heggernes} } @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 {1165, title = {Multi-dimensional clearing functions for aggregate capacity modelling in multi-stage production systems}, journal = {International Journal of Production Research}, volume = {55}, year = {2017}, pages = {4164{\textendash}4179}, author = {Albey, Erin{\c c} and {\"U}mit Bilge and Uzsoy, Reha} } @article {1158, title = {Musculoskeletal and visual symptoms among undergraduate students: Individual and computer-use-related risk factors and interference with academic performance}, journal = {International Journal of Industrial Ergonomics}, volume = {60}, year = {2017}, pages = {26 - 34}, keywords = {Academic performance, Computer, Musculoskeletal symptom, University student, Visual discomfort}, issn = {0169-8141}, doi = {https://doi.org/10.1016/j.ergon.2015.11.011}, url = {http://www.sciencedirect.com/science/article/pii/S0169814115300573}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {1163, title = {Optimal sensor deployment to increase the security of the maximal breach path in border surveillance}, journal = {European Journal of Operational Research}, volume = {259}, year = {2017}, pages = {19{\textendash}36}, author = {Karabulut, Ezgi and Necati Aras and I. Kuban Altinel} } @article {1452, title = {Performance analysis of an aggregation and disaggregation solution procedure to obtain a maintenance plan for a partially observable multi-component system}, journal = {Reliability Engineering \& System Safety}, volume = {167}, year = {2017}, pages = {652-662}, abstract = {

We analyze the performance of an aggregation and disaggregation procedure in giving the optimal maintenance decisions for a multi-component system under partial observations in a finite horizon. The components deteriorate in time and their states are hidden to the decision maker. Nevertheless, it is possible to observe signals about the system status and to replace components in each period. The aim is to find a cost effective replacement plan for the components in a given time horizon. The problem is formulated as a partially observable Markov decision process (POMDP). We aggregate states and actions in order to reduce the problem space and obtain an optimal aggregate policy which we disaggregate by simulating it using dynamic Bayesian networks (DBN). The procedure is statistically compared to an approximate POMDP solver that uses the full state space information. Cases where aggregation performs relatively better are isolated and it is shown that k-out-of-n systems belong to this class.

}, keywords = {Aggregation, Disaggregation, Dynamic Bayesian networks, Maintenance, Multi-component systems, Partially observable Markov decision processes}, issn = {0951-8320}, doi = {https://doi.org/10.1016/j.ress.2017.04.013}, url = {https://www.sciencedirect.com/science/article/pii/S095183201730443X}, author = {Demet {\"O}zg{\"u}r-{\"U}nl{\"u}ak{\i}n and Taner Bilgi{\c c}} } @article {1506, title = {A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs}, journal = {Information Processing Letters}, volume = {121}, year = {2017}, pages = {29-33}, abstract = {

It is known that the maximum cardinality cut problem is NP-hard even in chordal graphs. On the positive side, the problem is known to be polynomial time solvable in some subclasses of proper interval graphs which is in turn a subclass of chordal graphs. In this paper, we consider the time complexity of the problem in proper interval graphs, and propose a polynomial-time dynamic programming algorithm.

}, keywords = {Graph algorithms, Maximum cut, Proper interval graph}, issn = {0020-0190}, doi = {https://doi.org/10.1016/j.ipl.2017.01.007}, url = {https://www.sciencedirect.com/science/article/pii/S0020019017300133}, author = {Arman Boyac{\i} and Ekim, Tinaz and Mordechai Shalom} } @proceedings {1183, title = {Recent results on equimatchable graphs}, journal = {Combinatorial Potlatch}, year = {2017}, author = {Ekim, Tinaz} } @article {1458, title = {Reliability and mean residual life functions of coherent systems in an active redundancy}, journal = {Naval Research Logistics (NRL)}, volume = {64}, year = {2017}, pages = {19-28}, abstract = {

Abstract In this article, the reliability and the mean residual life (MRL) functions of a system with active redundancies at the component and system levels are investigated. In active redundancy at the component level, the original and redundant components are working together and lifetime of the system is determined by the maximum of lifetime of the original components and their spares. In the active redundancy at the system level, the system has a spare, and the original and redundant systems work together. The lifetime of such a system is then the maximum of lifetimes of the system and its spare. The lifetimes of the original component and the spare are assumed to be dependent random variables. {\textcopyright} 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 19{\textendash}28, 2017

}, keywords = {active redundancy, bivarite order statistics, coherent system, MRL functions, reliability function}, doi = {https://doi.org/10.1002/nav.21729}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21729}, author = {K{\"o}n{\"u}l Bayramo{\u g}lu Kavlak} } @conference {1167, title = {A scale-space theory and bag-of-features based time series classification method}, booktitle = {Signal Processing and Communications Applications Conference (SIU), 2017 25th}, year = {2017}, publisher = {IEEE}, organization = {IEEE}, author = {Altay, Tayip and Mustafa Gokce Baydogan} } @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 {1189, title = {The Shifting the Burden Archetype: A Workforce and Task Backlog Management Game}, journal = {Korean System Dynamics Review}, volume = {18}, year = {2017}, pages = {81-110}, author = {A. Mutallip and Hakan Ya{\c s}arcan} } @proceedings {1192, title = {The Analysis of Characteristic Dynamics of Stock Management Structure with a First Order Supply Line Delay}, journal = {34th International Conference of the System Dynamics Society}, year = {2016}, address = {Delft, the Netherlands}, author = {Mehmet S and Hakan Ya{\c s}arcan} } @proceedings {1191, title = {A Conceptual Feedback Model of Performance Dynamics}, journal = {The 34th International Conference of the System Dynamics Society}, year = {2016}, address = {Delft, the Netherlands}, author = {Van den Berg, AR and Hakan Ya{\c s}arcan} } @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 {1170, title = {Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes{\textemdash}Part I}, journal = {Discrete Applied Mathematics}, volume = {215}, year = {2016}, pages = {47{\textendash}60}, author = {Boyac{\i}, Arman and Ekim, Tinaz and Shalom, Mordechai and Zaks, Shmuel} } @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 {1466, title = {INVESTIGATING THE POTENTIAL OF STATE-TRUNCATIONAPPROXIMATIONS FOR PRODUCTION LINES}, journal = {Stochastic Modelling and Applications}, volume = {20}, year = {2016}, month = {Dec}, pages = {91{\textendash}109}, author = {Durmu{\c s}, Deniz and YERALAN, SENCER and Aybek Korugan} } @article {1462, title = {The mean wasted life time of a component of system}, journal = {Journal of Computational and Applied Mathematics}, volume = {305}, year = {2016}, month = {Oct}, pages = {44{\textendash}54}, issn = {03770427}, author = {K{\"o}n{\"u}l Bayramo{\u g}lu Kavlak} } @article {1172, title = {On the minimum and maximum selective graph coloring problems in some graph classes}, journal = {Discrete Applied Mathematics}, volume = {204}, year = {2016}, pages = {77{\textendash}89}, author = {Demange, Marc and Ekim, Tinaz and Ries, Bernard} } @proceedings {1190, title = {Modeling the Long Term Dynamics of Obesity as a Societal Epidemic}, journal = {34th International Conference of the System Dynamics Society}, year = {2016}, address = {Delft, the Netherlands}, author = {Akta{\c s}, Gizem and Nefel Tellio{\u g}lu and Yaman Barlas and Hakan Ya{\c s}arcan} } @article {1173, title = {A new multi-objective mathematical model for the high-level synthesis of integrated circuits}, journal = {Applied Mathematical Modelling}, volume = {40}, year = {2016}, pages = {2274{\textendash}2290}, author = {Necati Aras and Yurdakul, Arda} } @article {1171, title = {Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals}, journal = {European Journal of Operational Research}, volume = {254}, year = {2016}, pages = {985{\textendash}1001}, author = {T{\"u}rko{\u g}ullar{\i}, Yavuz B and Z. Caner Ta{\c s}k{\i}n and Necati Aras and I. Kuban Altinel} } @article {1089, title = {Optimal Berth Allocation, Time-variant Quay Crane Assignment and Scheduling with Crane Setups in Container Terminals}, journal = {European Journal of Operational Research}, volume = {254}, year = {2016}, pages = {985-1001}, doi = {http://dx.doi.org/10.1016/j.ejor.2016.04.022}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Z C Ta{\c s}k{\i}n and Necati Aras and I. Kuban Altinel} } @article {1194, title = {Optimal Sensor Deployment to Increase the Security of the Maximal Breach Path in Border Surveillance}, year = {2016}, institution = {Bo{\u g}azi{\c c}i University}, author = {Karabulut E and Necati Aras and I. Kuban Altinel} } @article {1177, title = {Prediction equations for permanent impairment of the upper extremity due to the loss of range of motion}, journal = {Work}, volume = {53}, year = {2016}, pages = {409{\textendash}420}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {1169, title = {PSO-based and SA-based metaheuristics for bilinear programming problems: an application to the pooling problem}, journal = {Journal of Heuristics}, volume = {22}, year = {2016}, pages = {147{\textendash}179}, author = {G{\"o}kalp Erbeyo{\u g}lu and {\"U}mit Bilge} } @article {1176, title = {Regional opportunities for China to go low-carbon: results from the REEC model}, journal = {The Energy Journal}, volume = {37}, year = {2016}, author = {Duan, Hongbo and Zhu, Lei and G{\"u}rkan Kumbaro{\u g}lu and Fan, Ying and others} } @article {1496, title = {Results of a beer game experiment: Should a manager always behave according to the book?}, journal = {Complexity}, volume = {21}, year = {2016}, pages = {190-199}, abstract = {

We investigate the effect of the literature suggested optimal values of the parameters of a dynamic decision-making heuristic in the presence of semirationally managed supply chain echelons using a soft coded one-to-one version of The Beer Game as an experimental platform. According to the counterintuitive results obtained in this study, it is possible for a {\textquotedblleft}rational manager{\textquotedblright} to obtain higher costs than the costs generated by a {\textquotedblleft}semirational manager.{\textquotedblright} Thus, the results do not support the use of the well-established decision parameter values for the echelon of concern if the other echelons{\textquoteright} inventories are managed suboptimally. {\textcopyright} 2015 Wiley Periodicals, Inc. Complexity 21: 190{\textendash}199, 2016

}, keywords = {anchor-and-adjust heuristic, artificial agents, beer game, stock management, supply chain management}, doi = {https://doi.org/10.1002/cplx.21731}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/cplx.21731}, author = {Edali, Mert and Yasarcan, Hakan} } @article {1168, title = {Sensitivity analysis for models with multiple behavior modes: a method based on behavior pattern measures}, journal = {System Dynamics Review}, volume = {32}, year = {2016}, pages = {332{\textendash}362}, author = {Hekimo{\u g}lu, Mustafa and Yaman Barlas} } @article {1063, title = {Time series representation and similarity based on local autopatterns}, journal = {Data Mining and Knowledge Discovery}, volume = {30}, year = {2016}, month = {03/2016}, pages = {476{\textendash}509}, abstract = {

Time series data mining has received much greater interest along with the increase in temporal data sets from different domains such as medicine, finance, multimedia, etc. Representations are important to reduce dimensionality and generate useful similarity measures. High-level representations such as Fourier transforms, wavelets, piecewise polynomial models, etc., were considered previously. Recently, autoregressive kernels were introduced to reflect the similarity of the time series. We introduce a novel approach to model the dependency structure in time series that generalizes the concept of autoregression to local autopatterns. Our approach generates a pattern-based representation along with a similarity measure called learned pattern similarity (LPS). A tree-based ensemble-learning strategy that is fast and insensitive to parameter settings is the basis for the approach. Then, a robust similarity measure based on the learned patterns is presented. This unsupervised approach to represent and measure the similarity between time series generally applies to a number of data mining tasks (e.g., clustering, anomaly detection, classification). Furthermore, an embedded learning of the representation avoids pre-defined features and an extraction step which is common in some feature-based approaches. The method generalizes in a straightforward manner to multivariate time series. The effectiveness of LPS is evaluated on time series classification problems from various domains. We compare LPS to eleven well-known similarity measures. Our experimental results show that LPS provides fast and competitive results on benchmark datasets from several domains. Furthermore, LPS provides a research direction and template approach that breaks from the linear dependency models to potentially foster other promising nonlinear approaches.

}, issn = {1573-756X}, author = {Mustafa Gokce Baydogan and Runger, George} } @article {1512, title = {Advances on defective parameters in graphs}, journal = {Discrete Optimization}, volume = {16}, year = {2015}, pages = {62-69}, abstract = {

We consider the generalization of Ramsey numbers to the defective framework using k-dense and k-sparse sets. We construct the first tableaux for defective Ramsey numbers with exact values whenever it is known, and lower and upper bounds otherwise. In light of defective Ramsey numbers, we consider the defective cocoloring problem which consists of partitioning the vertex set of a given graph into k-sparse and k-dense sets. By the help of efficient graph generation methods, we show that c0(4)=12,c1(3)=12 and c2(2)=10 where ck(m) is the maximum order n such that all n-graphs can be k-defectively cocolored using at most m colors. We also give the numbers of k-defective m-cocritical graphs of order n (until n=10) for different levels of defectiveness and m=2,3 and 4.

}, keywords = {Cocritical graphs, Defective cocoloring, Defective Ramsey numbers, Efficient graph generation}, issn = {1572-5286}, doi = {https://doi.org/10.1016/j.disopt.2015.01.002}, url = {https://www.sciencedirect.com/science/article/pii/S1572528615000031}, author = {Ahu Akdemir and Ekim, Tinaz} } @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 {icseri2015estimation, title = {Estimation of digraph costs for keyboard layout optimization}, journal = {International Journal of Industrial Ergonomics}, volume = {48}, year = {2015}, pages = {127{\textendash}138}, publisher = {Elsevier}, author = {{\.I}{\c s}eri, Ali and Mahmut Ek{\c s}io{\u g}lu} } @article {ekcsiouglu2015estimation, title = {An Estimation of Finger-Tapping Rates and Load Capacities and the Effects of Various Factors}, journal = {Human Factors: The Journal of the Human Factors and Ergonomics Society}, year = {2015}, pages = {0018720814563976}, publisher = {SAGE Publications}, author = {Mahmut Ek{\c s}io{\u g}lu and {\.I}{\c s}eri, Ali} } @article {ekcsiouglu2015hand, title = {Hand Torque Strength in Industry: A Critical Review}, journal = {Industrial Engineering Applications in Emerging Countries}, year = {2015}, pages = {81}, publisher = {CRC Press}, author = {Mahmut Ek{\c s}io{\u g}lu} } @proceedings {ekcsiougluinvestigation, title = {An Investigation of User-Experience Design of E-Commerce Websites}, year = {2015}, author = {Mahmut Ek{\c s}io{\u g}lu and Varol, Sevgican and Duman, Yusuf} } @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 {657, title = {Learning a symbolic representation for multivariate time series classification}, journal = {Data Mining and Knowledge Discovery}, volume = {29}, year = {2015}, month = {03/2015}, pages = {400-422}, publisher = {Springer US}, abstract = {

Multivariate time series (MTS) classification has gained importance with the increase in the number of temporal datasets in different domains (such as medicine, finance, multimedia, etc.). Similarity-based approaches, such as nearest-neighbor classifiers, are often used for univariate time series, but MTS are characterized not only by individual attributes, but also by their relationships. Here we provide a classifier based on a new symbolic representation for MTS (denoted as SMTS) with several important elements. SMTS considers all attributes of MTS simultaneously, rather than separately, to extract information contained in the relationships. Symbols are learned from a supervised algorithm that does not require pre-defined intervals, nor features. An elementary representation is used that consists of the time index, and the values (and first differences for numerical attributes) of the individual time series as columns. That is, there is essentially no feature extraction (aside from first differences) and the local series values are fused to time position through the time index. The initial representation of raw data is quite simple conceptually and operationally. Still, a tree-based ensemble can detect interactions in the space of the time index and time values and this is exploited to generate a high-dimensional codebook from the terminal nodes of the trees. Because the time index is included as an attribute, each MTS is learned to be segmented by time, or by the value of one of its attributes. The codebook is processed with a second ensemble where now implicit feature selection is exploited to handle the high-dimensional input. The constituent properties produce a distinctly different algorithm. Moreover, MTS with nominal and missing values are handled efficiently with tree learners. Experiments demonstrate the effectiveness of the proposed approach in terms of accuracy and computation times in a large collection multivariate (and univariate) datasets.

}, keywords = {codebook, Decision trees, supervised learning}, issn = {1384-5810}, doi = {10.1007/s10618-014-0349-y}, url = {http://dx.doi.org/10.1007/s10618-014-0349-y}, author = {Mustafa Gokce Baydogan and Runger, George} } @article {1467, title = {Locating recycling facilities for IT based electronic waste in Turkey}, journal = {Journal of Cleaner Production}, volume = {105}, year = {2015}, month = {Oct}, pages = {324{\textendash}336}, issn = {09596526}, author = {Necati Aras and Aybek Korugan and B{\"U}Y{\"U}K{\"O}ZKAN FEYZ{\.I}O{\u G}LU, G{\"U}L{\c C}{\.I}N and S{\.I}VR{\.I}KAYA {\c S}ER{\.I}FO{\u G}LU, FUNDA and Erol, Ismail and Nurtani{\c s} Velio{\u g}lu, Meltem} } @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 {908, title = {Metabolic connectivity as index of verbal working memory}, journal = {Journal of cerebral blood flow and metabolism}, volume = {35}, year = {2015}, month = {July}, pages = {1122{\textemdash}1126}, issn = {0271-678X}, doi = {10.1038/jcbfm.2015.40}, url = {http://dx.doi.org/10.1038/jcbfm.2015.40}, author = {Zou, Na and Chetelat, Gael and Mustafa Gokce Baydogan and Li, Jing and Fischer, Florian U and Titov, Dmitry and Dukart, Juergen and Fellgiebel, Andreas and Schreckenberger, Mathias and Yakushev, Igor} } @article {ekcsiouglu2015prediction, title = {Prediction equations for permanent impairment of the upper extremity due to the loss of range of motion}, journal = {Journal of WORK}, number = {Preprint}, year = {2015}, pages = {1{\textendash}12}, publisher = {IOS Press}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {1511, title = {On some applications of the selective graph coloring problem}, journal = {European Journal of Operational Research}, volume = {240}, year = {2015}, pages = {307-314}, abstract = {

In this paper we present the Selective Graph Coloring Problem, a generalization of the standard graph coloring problem as well as several of its possible applications. Given a graph with a partition of its vertex set into several clusters, we want to select one vertex per cluster such that the chromatic number of the subgraph induced by the selected vertices is minimum. This problem appeared in the literature under different names for specific models and its complexity has recently been studied for different classes of graphs. Here, we describe different models {\textendash} some already discussed in previous papers and some new ones {\textendash} in very different contexts under a unified framework based on this graph problem. We point out similarities between these models, offering a new approach to solve them, and show some generic situations where the selective graph coloring problem may be used. We focus on specific graph classes motivated by each model, and we briefly discuss the complexity of the selective graph coloring problem in each one of these graph classes and point out interesting future research directions.

}, keywords = {Combinatorial optimization, Computational complexity, Graph theory, partition coloring, Selective coloring}, issn = {0377-2217}, doi = {https://doi.org/10.1016/j.ejor.2014.05.011}, url = {https://www.sciencedirect.com/science/article/pii/S0377221714004184}, author = {Marc Demange and Ekim, Tinaz and Bernard Ries and Cerasela Tanasescu} } @article {941, title = {A Transfer Learning Approach for Predictive Modeling of Degenerate Biological Systems}, journal = {Technometrics}, volume = {57}, year = {2015}, pages = {362-373}, doi = {10.1080/00401706.2015.1044117}, url = {http://dx.doi.org/10.1080/00401706.2015.1044117}, author = {Na Zou and Yun Zhu and Ji Zhu and Mustafa Gokce Baydogan and Wei Wang and Jing Li} } @inbook {ekcsiouglu2015turkiye, title = {T{\"u}rkiye{\textquoteright}de {\.I}{\c s} Sa{\u g}l{\i}{\u g}{\i} ve G{\"u}venli{\u g}inin Genel Durumu, {\"O}neriler ve Sistem Yakla{\c s}{\i}m{\i}}, booktitle = {Ge-li-yo-rum Diyen Facia}, year = {2015}, pages = {165{\textendash}181}, publisher = {Bo{\u g}azi{\c c}i {\"U}niversitesi Yay{\i}nlar{\i}}, organization = {Bo{\u g}azi{\c c}i {\"U}niversitesi Yay{\i}nlar{\i}}, author = {Mahmut Ek{\c s}io{\u g}lu} } @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 {1460, title = {Baker- Lin-Huang Type Bivariate Distributions Based on Order Statistics}, journal = {Communications in Statistics - Theory and Methods}, volume = {43}, year = {2014}, pages = {1992-2006}, abstract = {

Baker (2008) introduced a new class of bivariate distributions based on distributions of order statistics from two independent samples of size n. Lin and Huang (2010) discovered an important property of Baker{\textquoteright}s distribution and showed that the Pearson{\textquoteright}s correlation coefficient for this distribution converges to maximum attainable value, i.e., the correlation coefficient of the Fr{\'e}chet upper bound, as n increases to infinity. Bairamov and Bayramoglu (2013) investigated a new class of bivariate distributions constructed by using Baker{\textquoteright}s model and distributions of order statistics from dependent random variables, allowing higher correlation than that of Baker{\textquoteright}s distribution. In this article, a new class of Baker{\textquoteright}s type bivariate distributions with high correlation are constructed based on distributions of order statistics by using an arbitrary continuous copula instead of the product copula.

}, doi = {10.1080/03610926.2013.775301}, url = {https://doi.org/10.1080/03610926.2013.775301}, author = {K{\"o}n{\"u}l Bayramo{\u g}lu Kavlak and I. Bayramoglu (Bairamov)} } @article {aksen2014bilevel, title = {A bilevel partial interdiction problem with capacitated facilities and demand outsourcing}, journal = {Computers \& Operations Research}, volume = {41}, year = {2014}, pages = {346{\textendash}358}, publisher = {Pergamon}, author = {Aksen, Deniz and {\c S}eng{\"u}l Akca, Sema and Necati Aras} } @article {ekim2014block, title = {Block decomposition approach to compute a minimum geodetic set}, journal = {RAIRO-Operations Research}, volume = {48}, number = {04}, year = {2014}, pages = {497{\textendash}507}, publisher = {EDP Sciences}, author = {Ekim, Tinaz and Erey, Aysel} } @article {1459, title = {On Censored Bivariate Random Variables: Copula, Characterization, and Estimation}, journal = {Communications in Statistics - Simulation and Computation}, volume = {43}, year = {2014}, pages = {2173-2185}, abstract = {

{ Let (X, Y) be a bivariate random vector with joint distribution function FX, Y(x, y) = C(F(x), G(y)), where C is a copula and F and G are marginal distributions of X and Y, respectively. Suppose that (Xi, Yi)

}, doi = {10.1080/03610918.2012.748911}, url = {https://doi.org/10.1080/03610918.2012.748911}, author = {K{\"o}n{\"u}l Bayramo{\u g}lu Kavlak and Ismihan Bayramoglu (bairamov)} } @conference {mutallip2014desired, title = {Desired Supply Line Value Calculation for Multi-Supplier Systems}, booktitle = {The 32nd International System Dynamics Conference, Delft, Netherlands}, year = {2014}, publisher = {System Dynamics Society (http://www.systemdynamics.org/conferences/2014/index.html)}, organization = {System Dynamics Society (http://www.systemdynamics.org/conferences/2014/index.html)}, author = {Mutallip, Ahmet and Yasarcan, Hakan} } @conference {feichtinger2014distributional, title = {A Distributional Approach to Generalized Stochastic Processes on Locally Compact Abelian Groups}, year = {2014}, pages = {423{\textendash}446}, publisher = {Springer International Publishing}, organization = {Springer International Publishing}, author = {Feichtinger, HG and Wolfgang H{\"o}rmann} } @conference {edali2014effect, title = {The Effect of Semi-Rational Supply Chain Members on the Decision Parameters Used in Managing the Stock of an Echelon}, booktitle = {The 32nd International System Dynamics Conference, Delft, Netherlands}, year = {2014}, publisher = {System Dynamics Society (http://www.systemdynamics.org/conferences/2014/index.html)}, organization = {System Dynamics Society (http://www.systemdynamics.org/conferences/2014/index.html)}, author = {Edali, Mert and Yasarcan, Hakan} } @article {demange2014efficient, title = {Efficient recognition of equimatchable graphs}, journal = {Information Processing Letters}, volume = {114}, number = {1}, year = {2014}, pages = {66{\textendash}71}, publisher = {Elsevier}, author = {Demange, Marc and Ekim, Tinaz} } @article {albey2014exploratory, title = {An exploratory study of disaggregated clearing functions for production systems with multiple products}, journal = {International Journal of Production Research}, number = {ahead-of-print}, year = {2014}, pages = {1{\textendash}22}, publisher = {Taylor \& Francis}, author = {Albey, Erin{\c c} and {\"U}mit Bilge and Uzsoy, Reha} } @article {Yavas2014, title = {Impact of Homophily on Diffusion Dynamics Over Social Networks}, journal = {Social Science Computer Review}, volume = {32}, number = {3}, year = {2014}, month = {mar}, abstract = {

The purpose of this study is to analyze the impact of homophily on diffusion over social networks. An agent-based simulation model is developed to serve as the experimental ground for this analysis. Diffusion dynamics of a nonsticky innovation is investigated by varying homophily levels in the social network depicted in the model as the primary control variable. First of all, the results show that homophily is self-reinforcing. Second, starting from a nonhomophilous network, early increases in the level of homophily have a positive effect on the extent of diffusion, whereas further increases have a negative impact. Finally, several local minima and maxima are observed in the relation between the homophily level and the extent of diffusion. Our analysis focuses on node properties such as connect- edness and average degrees in order to explain the observed regular relationship between homophily and diffusion. We argue that (i) homophily increases the connectedness of different status groups separately and (ii) increasing levels of homophily decreases the marginal importance of a single homo- philous tie by increasing the sources of valuable information. Future research involves investigating the coevolution of social behavior and networks by allowing the adopted innovation to lead to value homophily, exploration of different diffusion initiation types, and different adoption heuristics.

}, issn = {0894-4393}, doi = {10.1177/0894439313512464}, url = {http://ssc.sagepub.com/cgi/doi/10.1177/0894439313512464}, author = {Yava{\c s}, Mustafa and G{\"o}nen{\c c} Y{\"u}cel} } @article {671, title = {An Integer Programming-Based Search Technique for Error-Prone Substructures of LDPC Codes}, journal = {AEU - International Journal of Electronics and Communications}, volume = {68}, year = {2014}, pages = {1097-1105}, doi = {10.1016/j.aeue.2014.05.012}, author = {Abdullah Sar{\i}duman and Ali Emre Pusane and Z C Ta{\c s}k{\i}n} } @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}} } @article {1461, title = {Life behavior of shock models for uniformly distributed interarrival times}, journal = {Statistical Papers}, volume = {55}, year = {2014}, month = {Aug}, pages = {841{\textendash}852}, issn = {0932-5026}, author = {ERYILMAZ, SERKAN and K{\"o}n{\"u}l Bayramo{\u g}lu Kavlak} } @article {1497, title = {A Mathematical Model of the Beer Game}, journal = {Journal of Artificial Societies and Social Simulation}, volume = {17}, year = {2014}, pages = {2}, abstract = {

The beer production-distribution game, in short {\textquotedblleft}The Beer Game{\textquotedblright}, is a multiplayer board game, where each individual player acts as an independent agent. The game is widely used in management education aiming to give an experience to the participants about the potential dynamic problems that can be encountered in supply chain management, such as oscillations and amplification of oscillations as one moves from downstream towards upstream echelons. The game is also used in numerous scientific studies. In this paper, we construct a mathematical model that is an exact one-to-one replica of the original board version of The Beer Game. We apply model replication principles and discuss the difficulties we faced in the process of constructing the mathematical model. Accordingly, the model is presented in full precision including necessary assumptions, explanations, and units for all parameters and variables. In addition, the adjustable parameters are stated, the equations governing the artificial agents{\textquoteright} decision making processes are mentioned, and an R code of the model is provided. We also shortly discuss how the R code can be used in experimentation and how it can also be used to create a single-player or multi-player beer game on a computer. Our code can produce the exact same benchmark cost values reported by Sterman (1989) verifying that it is correctly implemented. The mathematical model and the R code presented in this paper aims to facilitate potential future studies based on The Beer Game.

}, keywords = {Acquisition Lag, artificial agents, beer game, Mathematical Model, Replication, System Dynamics}, issn = {1460-7425}, doi = {10.18564/jasss.2555}, url = {http://jasss.soc.surrey.ac.uk/17/4/2.html}, author = {Edali, Mert and Yasarcan, Hakan} } @article {edali2014mathematical, title = {A Mathematical Model of the Beer Game}, journal = {Journal of Artificial Societies and Social Simulation}, volume = {17}, number = {4}, year = {2014}, pages = {jasss{\textendash}soc}, publisher = {Journal of Artificial Societies and Social Simulation}, author = {Edali, Mert and Yasarcan, Hakan} } @article {._zba__2014, title = {Modeling and Simulation of the Endogenous Dynamics of Housing Market Cycles}, journal = {Journal of Artificial Societies and Social Simulation}, volume = {17}, number = {1}, year = {2014}, pages = {19}, abstract = {

The purpose of this study is to model and analyze by simulation the dynamics of endogenously created oscillations in real estate (housing) prices. A system dynamics simulation model is built to understand some of the structural sources of cycles in the key housing market variables, from the perspective of construction companies. The model focuses on the economic balance dynamics between supply and demand. Because of the unavoidable delays in the perception of the real estate market conditions and construction of new buildings, prices and related market variables exhibit strong oscillations. Two policies are tested to reduce the oscillations: decreasing the construction time, and taking into account the houses under construction in starting new projects. Both policies yield significantly reduced oscillations, more stable behaviors.

}, keywords = {Housing Cycles, Price Oscillations, Real Estate Modeling, Socio-Economic Simulation, System Dynamics}, issn = {1460-7425}, url = {http://jasss.soc.surrey.ac.uk/17/1/19.html}, author = {Birnur {\"O}zba{\c s} and Onur {\"O}zg{\"u}n and Yaman Barlas} } @article {bacsdere2014operational, title = {Operational aircraft maintenance routing problem with remaining time consideration}, journal = {European Journal of Operational Research}, volume = {235}, number = {1}, year = {2014}, pages = {315{\textendash}328}, publisher = {Elsevier}, author = {Ba{\c s}dere, Mehmet and {\"U}mit Bilge} } @article {TurkogullariEtAl2014, title = {Optimal berth allocation and time-invariant quay crane assignment in container terminals}, journal = {European Journal of Operational Research}, volume = {235}, number = {1}, year = {2014}, pages = {88{\textendash}101}, doi = {http://dx.doi.org/10.1016/j.ejor.2013.10.015}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Z C Ta{\c s}k{\i}n and Necati Aras and I. Kuban Altinel} } @article {ekim2014polar, title = {Polar cographs}, journal = {Discrete Applied Mathematics}, volume = {171}, number = {EPFL-ARTICLE-199582}, year = {2014}, pages = {158{\textendash}158}, publisher = {Elsevier Science Bv}, author = {Ekim, Tinaz and Mahadev, NVR and de Werra, Dominique} } @article {ozgur2014replacement, title = {Replacement policies for a complex system with unobservable components using dynamic Bayesian networks}, journal = {International Journal of Computational Intelligence Systems}, volume = {7}, number = {sup1}, year = {2014}, pages = {68{\textendash}83}, publisher = {Taylor \& Francis}, author = {{\"O}zg{\"u}r-{\"U}nl{\"u}akin, Demet and Taner Bilgi{\c c}} } @article {ekcsiouglu2014save, title = {Save the Musicians! The Ergonomics of the Drumming}, journal = {Advances in Physical Ergonomics and Human Factors: Part II}, volume = {15}, year = {2014}, pages = {269}, publisher = {AHFE Conference}, author = {Mahmut Ek{\c s}io{\u g}lu and {\"O}zt{\"u}rk, N Kaan and {\c S}irin, Orkun} } @inbook {aras2014simultaneous, title = {Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals}, booktitle = {Operations Research Proceedings 2012}, year = {2014}, pages = {101{\textendash}107}, publisher = {Springer International Publishing}, organization = {Springer International Publishing}, author = {Necati Aras and T{\"u}rko{\u g}ullar{\i}, Yavuz and Z C Ta{\c s}k{\i}n and I. Kuban Altinel} } @article {35, title = {SMT: Sparse multivariate tree}, journal = {Statistical Analysis and Data Mining}, volume = {7}, year = {2014}, month = {02/2014}, pages = {53-69}, abstract = {

A multivariate decision tree attempts to improve upon the single variable split in a traditional tree. With the increase in datasets with many features and a small number of labeled instances in a variety of domains (bioinformatics, text mining, etc.), a traditional tree-based approach with a greedy variable selection at a node may omit important information. Therefore, the recursive partitioning idea of a simple decision tree combined with the intrinsic feature selection of L1 regularized logistic regression (LR) at each node is a natural choice for a multivariate tree model that is simple, but broadly applicable. This natural solution leads to the sparse multivariate tree (SMT) considered here. SMT can naturally handle non-time-series data and is extended to handle time-series classification problems with the power of extracting interpretable temporal patterns (e.g., means, slopes, and deviations). Binary L1 regularized LR models are used here for binary classification problems. However, SMT may be extended to solve multiclass problems with multinomial LR models. The accuracy and computational efficiency of SMT is compared to a large number of competitors on time series and non-time-series data.

}, keywords = {decision tree, feature extraction, fused Lasso, Lasso, time series classification}, issn = {1932-1872}, doi = {10.1002/sam.11208}, url = {http://dx.doi.org/10.1002/sam.11208}, author = {Houtao Deng and Mustafa Gokce Baydogan and George Runger} } @article {1463, title = {Univariate Interval Censoring with Two Random Intervals}, journal = {Social Sciences Research Journal}, volume = {3}, year = {2014}, month = {Sep}, pages = {1{\textendash}4}, issn = {2147-5237}, author = {K{\"o}n{\"u}l Bayramo{\u g}lu Kavlak} } @article {keskin2014wireless, title = {Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility}, journal = {Ad Hoc Networks}, volume = {17}, year = {2014}, pages = {18{\textendash}36}, publisher = {Elsevier}, author = {Keskin, M Emre and I. Kuban Altinel and Necati Aras and Ersoy, Cem} } @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 {33, title = {A Bag-of-Features Framework to Classify Time Series}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {35}, year = {2013}, pages = {2796-2802}, abstract = {

Time series classification is an important task with many challenging applications. A nearest neighbor (NN) classifier with dynamic time warping (DTW) distance is a strong solution in this context. On the other hand, feature-based approaches have been proposed as both classifiers and to provide insight into the series, but these approaches have problems handling translations and dilations in local patterns. Considering these shortcomings, we present a framework to classify time series based on a bag-of-features representation (TSBF). Multiple subsequences selected from random locations and of random lengths are partitioned into shorter intervals to capture the local information. Consequently, features computed from these subsequences measure properties at different locations and dilations when viewed from the original series. This provides a feature-based approach that can handle warping (although differently from DTW). Moreover, a supervised learner (that handles mixed data types, different units, etc.) integrates location information into a compact codebook through class probability estimates. Additionally, relevant global features can easily supplement the codebook. TSBF is compared to NN classifiers and other alternatives (bag-of-words strategies, sparse spatial sample kernels, shapelets). Our experimental results show that TSBF provides better results than competitive methods on benchmark datasets from the UCR time series database.

}, keywords = {codebook, feature extraction, supervised learning}, issn = {0162-8828}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2013.72}, author = {Mustafa Gokce Baydogan and George Runger and Eugene Tuv} } @article {aksen2013bilevel, title = {A bilevel p-median model for the planning and protection of critical facilities}, journal = {Journal of Heuristics}, volume = {19}, number = {2}, year = {2013}, pages = {373{\textendash}398}, publisher = {Springer US}, author = {Aksen, Deniz and Necati Aras and Piyade, Nuray} } @article {TaskinCevik2013, title = {Combinatorial Benders Cuts for Decomposing IMRT Fluence Maps Using Rectangular Apertures}, journal = {Computers and Operations Research}, volume = {40(9)}, year = {2013}, pages = {2178{\textendash}2186}, doi = {http://dx.doi.org/10.1016/j.cor.2011.07.005}, author = {Z C Ta{\c s}k{\i}n and Mucahit Cevik} } @article {dingecc2013control, title = {Control variates and conditional Monte Carlo for basket and Asian options}, journal = {Insurance: Mathematics and Economics}, volume = {52}, number = {3}, year = {2013}, pages = {421{\textendash}434}, publisher = {North-Holland}, author = {Dinge{\c c}, Kemal Din{\c c}er and Wolfgang H{\"o}rmann} } @article {BodurEtAl2013, title = {Decomposition Algorithms for Solving the Minimum Weight Maximal Matching Problem}, journal = {Networks}, volume = {62}, number = {4}, year = {2013}, pages = {273{\textendash}287}, doi = {http://dx.doi.org/10.1002/net.21516}, author = {Merve Bodur and Ekim, Tinaz and Z C Ta{\c s}k{\i}n} } @proceedings {nisa1, title = {Evaluation of Alternative Dynamic Behavior Representations for Automated Model Output Classification and Clustering}, journal = {31st International Conference of the System Dynamics Society}, year = {2013}, author = {Nisa {\"O}nsel and E. {\"O}nsel and G{\"o}nen{\c c} Y{\"u}cel} } @article {Yucel2013, title = {Extent of inertia caused by the existing building stock against an energy transition in the Netherlands}, journal = {Energy and Buildings}, volume = {56}, year = {2013}, pages = {134{\textendash}145}, keywords = {residential energy consumption}, issn = {03787788}, doi = {10.1016/j.enbuild.2012.09.022}, url = {http://linkinghub.elsevier.com/retrieve/pii/S0378778812004720}, author = {G{\"o}nen{\c c} Y{\"u}cel} } @article {icseri2013finger, title = {Finger tapping rates and the effects of various factors}, journal = {Occupational Safety and Hygiene}, year = {2013}, pages = {31}, publisher = {CRC Press}, author = {{\.I}{\c s}eri, A and Mahmut Ek{\c s}io{\u g}lu} } @article {1464, title = {From the Huang Kotz FGM distribution to Baker s bivariate distribution}, journal = {Journal of Multivariate Analysis}, volume = {113}, year = {2013}, month = {Jan}, pages = {106{\textendash}115}, issn = {0047259X}, author = {BAYRAMO{\u G}LU, {\.I}SM{\.I}HAN and K{\"o}n{\"u}l Bayramo{\u g}lu Kavlak} } @article {hormann2013generating, title = {Generating generalized inverse Gaussian random variates}, journal = {Statistics and Computing}, year = {2013}, pages = {1{\textendash}11}, publisher = {Springer US}, author = {Wolfgang H{\"o}rmann and Leydold, Josef} } @article {boyaci2013graphs, title = {Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations}, year = {2013}, author = {Boyac{\i}, Arman and Ekim, Tinaz and Shalom, Mordechai and Zaks, Shmuel} } @article {eksioglu2013hand, title = {Hand torque strength of female population of Turkey and the effects of various factors}, journal = {Occupational Safety and Hygiene}, year = {2013}, pages = {37}, publisher = {CRC Press}, author = {Mahmut Ek{\c s}io{\u g}lu and Recep, Z} } @article {demange2013hardness, title = {Hardness and approximation of minimum maximal matchings}, journal = {International Journal of Computer Mathematics}, number = {ahead-of-print}, year = {2013}, pages = {1{\textendash}20}, publisher = {Taylor \& Francis}, author = {Demange, Marc and Ekim, Tinaz and Tanasescu, Cerasela} } @article {bacsdere2013leader, title = {A leader-follower game for the point coverage problem in wireless sensor networks}, journal = {European Journal of Industrial Engineering}, volume = {7}, number = {5}, year = {2013}, pages = {635{\textendash}656}, publisher = {Inderscience Publishers}, author = {Ba{\c s}dere, Mehmet and Necati Aras and I. Kuban Altinel and Af{\c s}ar, Sezin} } @article {bilge2013mathematical, title = {Mathematical models for FMS loading and part type selection with flexible process plans}, journal = {European Journal of Industrial Engineering}, year = {2013}, publisher = {Inderscience}, author = {{\"U}mit Bilge and Albey, Erin{\c c} and Be{\c s}ikci, Umut and Erbatur, Kemalettin and Aslan, Ay{\c s}e Nur} } @inbook {aksen2013matheuristic, title = {A Matheuristic for Leader-Follower Games Involving Facility Location-Protection-Interdiction Decisions}, booktitle = {Metaheuristics for Bi-level Optimization}, year = {2013}, pages = {115{\textendash}151}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {Aksen, Deniz and Necati Aras} } @inbook {bilgicc2013membership, title = {The Membership Function and Its Measurement}, booktitle = {On Fuzziness}, year = {2013}, pages = {47{\textendash}53}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {Taner Bilgi{\c c}}, editor = {Seising R, Trillas E, Moraga C, Termini S} } @mastersthesis {erbeyoglu, title = {Metaheuristic Approaches to the Pooling Problem}, year = {2013}, school = {Bo{\u g}azi{\c c}i University}, type = {MS}, author = {G{\"o}kalp Erbeyo{\u g}lu} } @proceedings {nisa2, title = {Modeling the Dynamics of Methylmercury Biomagnification}, journal = {31st International Conference of the System Dynamics Society}, year = {2013}, author = {Bacaks{\i}zlar, N. G. and Nisa {\"O}nsel} } @article {demange2013note, title = {A note on the NP-hardness of two matching problems in induced subgrids}, journal = {Discrete Mathematics and Theoretical Computer Science}, volume = {15}, number = {2}, year = {2013}, pages = {233{\textendash}242}, author = {Demange, Marc and Ekim, Tinaz and others} } @article {bacsouglu2013optimally, title = {Optimally stratified importance sampling for portfolio risk with multiple loss thresholds}, journal = {Optimization}, volume = {62}, number = {11}, year = {2013}, pages = {1451{\textendash}1471}, publisher = {Taylor \& Francis}, author = {Ba{\c s}o{\u g}lu, {\.I}smail and Wolfgang H{\"o}rmann and Sak, Halis} } @article {bonomo2013perfectness, title = {Perfectness of clustered graphs}, journal = {Discrete Optimization}, volume = {10}, number = {4}, year = {2013}, pages = {296{\textendash}303}, publisher = {Elsevier}, author = {Bonomo, Flavia and Cornaz, Denis and Ekim, Tinaz and Ries, Bernard} } @article {ekim2013polar, title = {Polar permutation graphs are polynomial-time recognisable}, journal = {European Journal of Combinatorics}, volume = {34}, number = {3}, year = {2013}, pages = {576{\textendash}592}, publisher = {Academic Press}, author = {Ekim, Tinaz and Heggernes, Pinar and Meister, Daniel} } @article {1470, title = {On the quality variation impact of returns in remanufacturing}, journal = {Computers \& Industrial Engineering}, volume = {64}, year = {2013}, month = {Apr}, pages = {929{\textendash}936}, issn = {03608352}, author = {Aybek Korugan and Dinge{\c c}, Kemal Din{\c c}er and {\"O}nen, Tolga and Ate{\c s}, N{\"u}fer Y} } @article {becsikci2013resource, title = {Resource dedication problem in a multi-project environment}, journal = {Flexible Services and Manufacturing Journal}, volume = {25}, number = {1-2}, year = {2013}, pages = {206{\textendash}229}, publisher = {Springer}, author = {Be{\c s}ikci, Umut and {\"U}mit Bilge and Ulusoy, G{\"u}nd{\"u}z} } @mastersthesis {857, title = {Solving Integrated Berth Allocation And Crane Assignment Problem Using A Tabu Search Metaheuristic}, year = {2013}, author = {Zeynep {\c S}uvak} } @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} } @article {1469, title = {A stochastic analysis of asynchronous demand in disassembly processes of remanufacturing systems}, journal = {European Journal of Industrial Engineering}, volume = {7}, year = {2013}, pages = {175{\textendash}205}, author = {Dinge{\c c} , Kemal Din{\c c}er and Aybek Korugan} } @conference {icseritapping, title = {Tapping Rates of Fingers and the Effects of Age, Gender and Hand Preference}, booktitle = {SHO2013 {\textendash}International Symposium on Occupational Safety and Hygiene}, year = {2013}, author = {{\.I}{\c s}eri, Ali and Mahmut Ek{\c s}io{\u g}lu} } @article {botts2013transformed, title = {Transformed density rejection with inflection points}, journal = {Statistics and Computing}, volume = {23}, number = {2}, year = {2013}, pages = {251{\textendash}260}, publisher = {Springer US}, author = {Botts, Carsten and Wolfgang H{\"o}rmann and Leydold, Josef} } @article {fas2013two, title = {A two-period dynamic game for a substitutable product inventory control problem}, journal = {International Journal of Inventory Research}, volume = {2}, number = {1-2}, year = {2013}, pages = {108{\textendash}126}, publisher = {Inderscience Publishers Ltd}, author = {Fas, Genco and Taner Bilgi{\c c}} } @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 {aksen2012bilevel, title = {A bilevel fixed charge location model for facilities under imminent attack}, journal = {Computers \& Operations Research}, volume = {39}, number = {7}, year = {2012}, pages = {1364{\textendash}1381}, publisher = {Pergamon}, author = {Aksen, Deniz and Necati Aras} } @article {kucukaydin2012ciftduzeyli, title = {Ciftduzeyli Bir Rekabetci Tesis Yer Secimi Problemi Icin Tabu Arama Sezgiseli}, journal = {Endustri Muhendisligi Dergisi}, volume = {23}, number = {1}, year = {2012}, publisher = {TMMOB Makina Muhendisleri Odasi}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, Hande and Necati Aras and I. Kuban Altinel} } @inbook {ekim2012computing, title = {Computing minimum geodetic sets of proper interval graphs}, booktitle = {LATIN 2012: Theoretical Informatics}, year = {2012}, pages = {279{\textendash}290}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {Ekim, Tinaz and Erey, Aysel and Heggernes, Pinar and van{\textquoteright}t Hof, Pim and Meister, Daniel} } @conference {tanyolacc2012control, title = {Control Heuristics for Soft Landing Problem}, booktitle = {The 30th International System Dynamics Conference, St. Gallen, Switzerland}, year = {2012}, publisher = {System Dynamics Society (http://www.systemdynamics.org/conferences/2012/index.html)}, organization = {System Dynamics Society (http://www.systemdynamics.org/conferences/2012/index.html)}, author = {Tanyola{\c c}, Togay and Yasarcan, Hakan} } @proceedings {ozgun, title = {Effects of Delay, Nonlinearity and Feedback on the Overall Complexity of a Stock Management Game}, journal = {30th International Conference of the System Dynamics Society}, year = {2012}, author = {Onur {\"O}zg{\"u}n and Yaman Barlas} } @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 {1477, title = {Evaluation of economically optimal retrofit investment options for energy savings in buildings}, journal = {Energy and Buildings}, volume = {49}, year = {2012}, pages = {327-334}, abstract = {

In this study, a techno-economic evaluation method for the energy retrofit of buildings is introduced, geared toward finding the economically optimal set of retrofit measures. Split incentives of building owners and users are considered explicitly in a conventional (static) evaluation to identify the investment alternatives maximizing the net present value (NPV). Energy price uncertainty for various distributional assumptions of the stochastic variables is addressed through Monte Carlo simulation. Results from the simulation are used to compute probabilities and expected NPVs. Based on this, a sequential (dynamic) evaluation method is developed, featuring a real options investment appraisal. The real options approach is introduced as an advancement in the practice of economic evaluation of building retrofit investment options. The new method is applied to an office building in Germany, illustrating its performance. The case study results indicate that energy price changes significantly affect the profitability of retrofit investments, and that high price volatility creates a substantial value of waiting, making it more rational to postpone the investment.

}, keywords = {Building energy efficiency, Energy conservation, Net present value, Real options}, issn = {0378-7788}, doi = {https://doi.org/10.1016/j.enbuild.2012.02.022}, url = {https://www.sciencedirect.com/science/article/pii/S0378778812000990}, author = {G{\"u}rkan Kumbaro{\u g}lu and Reinhard Madlener} } @article {Kwakkel2012, title = {An Exploratory Analysis of the Dutch Electricity System in Transition}, journal = {Journal of the Knowledge Economy}, year = {2012}, pages = {1{\textendash}16}, publisher = {Springer US}, abstract = {

Recent contextual developments constitute a backdrop of change for the Dutch electricity system. Institutional change driven by liberalization, changing economic competitiveness of the dominant fuels, new technologies, and changing end-user preferences regarding electricity supply are some exam- ples of these developments. This paper explores plausible transition trajectories in the face of these developments given technological uncertainty about invest- ment and operating costs, and fuel efficiency of various alternative technolo- gies; political uncertainty about future CO2 abatement policies such as emission trading; and socio-economic uncertainty about fuel prices, investment decisions of suppliers, and load curves. Various alternative developments for these uncertainties are specified. The consequences of each of these alternative developments are assessed using an agent-based model of the Dutch electricity system. The outputs are analyzed using various data-mining and data visualization techniques in order to reveal arch-typical transition trajectories and their conditions for occurring. Policy recommendations are derived from this. The results indicate that most transition trajectories point towards a future energy supply system that is reliant on clean coal and gas. Under the explored uncertainties, only rarely a transition to renewables occurs. The various sustainable energy support programs appear to be ineffective in steering the energy supply system towards a more sustainable mode of functioning across the various uncertainties.

}, keywords = {Electricity supply, Exploratory model, Transitions}, issn = {1868-7865}, doi = {10.1007/s13132-012-0128-1}, url = {http://dx.doi.org/10.1007/s13132-012-0128-1}, author = {Kwakkel, Jan and G{\"o}nen{\c c} Y{\"u}cel} } @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 {sak2012fast, title = {Fast simulations in credit risk}, journal = {Quantitative Finance}, volume = {12}, number = {10}, year = {2012}, pages = {1557{\textendash}1569}, publisher = {Routledge}, author = {Sak, Halis and Wolfgang H{\"o}rmann} } @article {dingecc2012general, title = {A general control variate method for option pricing under L{\'e}vy processes}, journal = {European Journal of Operational Research}, volume = {221}, number = {2}, year = {2012}, pages = {368{\textendash}377}, publisher = {North-Holland}, author = {Dinge{\c c}, Kemal Din{\c c}er and Wolfgang H{\"o}rmann} } @conference {kucukaydin2012hybrid, title = {Hybrid Tabu Search Heuristics for a Bilevel Competitive Facility Location Model}, booktitle = {26th Annual Conference of the Belgian Operational Research Society}, year = {2012}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, Hande and Necati Aras and I. Kuban Altinel} } @article {keccici2012incorporating, title = {Incorporating the threat of terrorist attacks in the design of public service facility networks}, journal = {Optimization Letters}, volume = {6}, number = {6}, year = {2012}, pages = {1101{\textendash}1121}, publisher = {Springer-Verlag}, author = {Ke{\c c}ici, Serhat and Necati Aras and Verter, Vedat} } @article {TaskinEkim2012, title = {Integer Programming Formulations for the Minimum Weighted Maximal Matching Problem}, journal = {Optimization Letters}, volume = {6(6)}, year = {2012}, pages = {1161-1171}, doi = {http://dx.doi.org/10.1007/s11590-011-0351-x}, author = {Z C Ta{\c s}k{\i}n and Ekim, Tinaz} } @article {kuccukaydin2012leader, title = {A leader{\textendash}follower game in competitive facility location}, journal = {Computers \& Operations Research}, volume = {39}, number = {2}, year = {2012}, pages = {437{\textendash}448}, publisher = {Elsevier}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, Hande and Necati Aras and I. Kuban Altinel} } @article {kocsucuouglu2012material, title = {Material handling considerations in the FMS loading problem with full routing flexibility}, journal = {International Journal of Production Research}, volume = {50}, number = {22}, year = {2012}, pages = {6530{\textendash}6552}, publisher = {Taylor \& Francis}, author = {Ko{\c s}ucuo{\u g}lu, Deniz and {\"U}mit Bilge} } @article {TaskinEtAl2012, title = {Mixed-Integer Programming Techniques for Decomposing IMRT Fluence Maps Using Rectangular Apertures}, journal = {Annals of Operations Research}, volume = {196(1)}, year = {2012}, pages = {799-818}, doi = {http://dx.doi.org/10.1007/s10479-010-0767-1}, author = {Z C Ta{\c s}k{\i}n and J. Cole Smith and H. Edwin Romeijn} } @article {1476, title = {Modeling and analysis of a decentralized electricity market: An integrated simulation/optimization approach}, journal = {Energy}, volume = {44}, year = {2012}, pages = {830-852}, abstract = {

In this study, a model is developed to investigate the implications of an hourly day-ahead competitive power market on generator profits, electricity prices, availability and supply security. An integrated simulation/optimization approach is employed integrating a multi-agent simulation model with two alternative optimization models. The simulation model represents interactions between power generator, system operator, power user and power transmitter agents while the network flow optimization model oversees and optimizes the electricity flows, dispatches generators based on two alternative approaches used in the modeling of the underlying transmission network: a linear minimum cost network flow model and a non-linear alternating current optimal power flow model. Supply, demand, transmission, capacity and other technological constraints are thereby enforced. The transmission network, on which the scenario analyses are carried out, includes 30 bus, 41 lines, 9 generators, and 21 power users. The scenarios examined in the analysis cover various settings of transmission line capacities/fees, and hourly learning algorithms. Results provide insight into key behavioral and structural aspects of a decentralized electricity market under network constraints and reveal the importance of using an AC network instead of a simplified linear network flow approach.

}, keywords = {Alternative current optimum power flow, Electricity market modeling and design, Minimum cost network flow, Multi-agent simulation}, issn = {0360-5442}, doi = {https://doi.org/10.1016/j.energy.2012.05.009}, url = {https://www.sciencedirect.com/science/article/pii/S036054421200388X}, author = {Kemal Sar{\i}ca and G{\"u}rkan Kumbaro{\u g}lu and {\.I}lhan Or} } @conference {dingecc2012new, title = {New control variates for L{\'e}vy process models}, booktitle = {Proceedings of the Winter Simulation Conference}, year = {2012}, pages = {15}, publisher = {Winter Simulation Conference}, organization = {Winter Simulation Conference}, author = {Dinge{\c c}, Kemal Din{\c c}er and Wolfgang H{\"o}rmann} } @conference {mutallip2012parametric, title = {A Parametric Analysis of the Effect of a Material Supply Line Delay in Stock Management}, booktitle = {The 30th International System Dynamics Conference, St. Gallen, Switzerland}, year = {2012}, publisher = {System Dynamics Society (http://www.systemdynamics.org/conferences/2012/index.html)}, organization = {System Dynamics Society (http://www.systemdynamics.org/conferences/2012/index.html)}, author = {Mutallip, Ahmet and Yasarcan, Hakan} } @article {1465, title = {Residual Lifetime of Consecutive $k$-out-of- $n$ Systems Under Double Monitoring}, journal = {IEEE Transactions on Reliability}, volume = {61}, year = {2012}, pages = {792-797}, doi = {10.1109/TR.2012.2206272}, author = {ERYILMAZ, SERKAN and K{\"o}n{\"u}l Bayramo{\u g}lu Kavlak} } @article {Yucel2012, title = {A simulation-based analysis of transition pathways for the Dutch electricity system}, journal = {Energy Policy}, volume = {42}, year = {2012}, pages = {557{\textendash}568}, issn = {03014215}, doi = {10.1016/j.enpol.2011.12.024}, url = {http://linkinghub.elsevier.com/retrieve/pii/S0301421511010299}, author = {G{\"o}nen{\c c} Y{\"u}cel and van Daalen, Cornelia} } @conference {yasarcan2012soft, title = {A Soft Landing Model and an Experimental Platform as an Introductory Control Design Tool}, booktitle = {The 30th International System Dynamics Conference, St. Gallen, Switzerland}, year = {2012}, publisher = {System Dynamics Society (http://www.systemdynamics.org/conferences/2012/index.html)}, organization = {System Dynamics Society (http://www.systemdynamics.org/conferences/2012/index.html)}, author = {Yasarcan, Hakan and Tanyola{\c c}, Togay} } @proceedings {ozgun, title = {Systemic Complexity of a Growth Management Game: Comparative Analysis of Decision Heuristics and Experimental Results}, journal = {30th International Conference of the System Dynamics Society}, year = {2012}, author = {Onur {\"O}zg{\"u}n and Yaman Barlas} } @article {doyen2012two, title = {A two-echelon stochastic facility location model for humanitarian relief logistics}, journal = {Optimization Letters}, volume = {6}, number = {6}, year = {2012}, pages = {1123{\textendash}1145}, publisher = {Springer-Verlag}, author = {D{\"o}yen, Alper and Necati Aras and Barbaroso{\u g}lu, G{\"u}lay} } @article {Yucel2011, title = {Automated parameter specification in dynamic feedback models based on behavior pattern features}, journal = {System Dynamics Review}, volume = {27}, number = {2}, year = {2011}, pages = {195{\textendash}215}, publisher = {Wiley Online Library}, keywords = {Calibration}, doi = {10.1002/sdr}, url = {http://onlinelibrary.wiley.com/doi/10.1002/sdr.457/full}, author = {G{\"o}nen{\c c} Y{\"u}cel and Yaman Barlas} } @article {14445765, title = {{Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution}}, journal = {European Journal of Operational Research}, volume = {208}, year = {2011}, pages = {206{\textendash}220}, doi = {10.1016/j.ejor.2010.08.009}, author = {Hande K{\"u}{\c c}{\"u}kaydin and Necati Aras and I. Kuban Altinel} } @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 {becsikcci2011different, title = {Different resource management policies in multi-mode resource constrained multi-project scheduling}, year = {2011}, publisher = {Institute of Electrical and Electronics Engineers, Inc.}, author = {Be{\c s}ikci, Umut and {\"U}mit Bilge and Ulusoy, G{\"u}nd{\"u}z} } @article {kuccukaydin2011discrete, title = {A discrete competitive facility location model with variable attractiveness}, journal = {Journal of the Operational Research Society}, volume = {62}, number = {9}, year = {2011}, pages = {1726{\textendash}1741}, publisher = {Nature Publishing Group}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, H and Necati Aras and I. Kuban Altinel} } @article {eksioglu2011endurance, title = {Endurance time of grip-force as a function of grip-span, posture and anthropometric variables}, journal = {International Journal of Industrial Ergonomics}, volume = {41}, number = {5}, year = {2011}, pages = {401{\textendash}409}, publisher = {Elsevier}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {Yucel2011a, title = {Exploratory analysis of the impact of information dynamics on innovation diffusion}, journal = {Technological Forecasting and Social Change}, volume = {78}, number = {2}, year = {2011}, pages = {358{\textendash}372}, publisher = {Elsevier Inc.}, keywords = {diffusion of innovations, information diffusion, negative word-of-mouth, Simulation model}, issn = {00401625}, doi = {10.1016/j.techfore.2010.11.004}, url = {http://linkinghub.elsevier.com/retrieve/pii/S0040162510002684}, author = {G{\"o}nen{\c c} Y{\"u}cel and van Daalen, Cornelia} } @article {leydold2011generating, title = {Generating generalized inverse Gaussian random variates by fast inversion}, journal = {Computational Statistics \& Data Analysis}, volume = {55}, number = {1}, year = {2011}, pages = {213{\textendash}217}, publisher = {North-Holland}, author = {Leydold, Josef and Wolfgang H{\"o}rmann} } @inbook {ekcsiouglu2011heuristic, title = {Heuristic evaluation and usability testing: case study}, booktitle = {Internationalization, Design and Global Development}, year = {2011}, pages = {143{\textendash}151}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {Mahmut Ek{\c s}io{\u g}lu and Kiris, Esin and \cCapar, Burak and Sel{\c c}uk, Murat N and Ouzeir, Selen} } @article {albey2011hierarchical, title = {A hierarchical approach to FMS planning and control with simulation-based capacity anticipation}, journal = {International Journal of Production Research}, volume = {49}, number = {11}, year = {2011}, pages = {3319{\textendash}3342}, publisher = {Taylor \& Francis}, author = {Albey, Erin{\c c} and {\"U}mit Bilge} } @conference {yasarcan2011information, title = {Information Sharing in Supply Chains: A Systemic Approach}, booktitle = {The 29th International System Dynamics Conference, Washington, DC, USA}, year = {2011}, publisher = {System Dynamics Society (http://www.systemdynamics.org/conferences/2011/index.htm)}, organization = {System Dynamics Society (http://www.systemdynamics.org/conferences/2011/index.htm)}, author = {Yasarcan, Hakan} } @article {keskin2011lifetime, title = {Lifetime maximization in wireless sensor networks using a mobile sink with nonzero traveling time}, journal = {The Computer Journal}, year = {2011}, pages = {bxr048}, publisher = {Oxford University Press}, author = {Keskin, M Emre and I. Kuban Altinel and Necati Aras and Ersoy, Cem} } @proceedings {nisa3, title = {Modeling the Dynamics of Academic Publications and Citations}, journal = {29th International Conference of the System Dynamics Society}, year = {2011}, author = {Nisa {\"O}nsel and Yaman Barlas} } @mastersthesis {nisa6, title = {Modeling the Dynamics of Academic Publications and Citations}, year = {2011}, school = {Bo{\u g}azi{\c c}i University}, type = {MS}, author = {Nisa {\"O}nsel} } @mastersthesis {seker_ms, title = {Modeling the Dynamics of Thyroid Hormones and Related Disorders}, year = {2011}, school = {Bo{\u g}azi{\c c}i University}, type = {MS}, author = {Oylum {\c S}eker} } @proceedings {seker, title = {Modeling the Dynamics of Thyroid Hormones and Related Disorders}, journal = {29th International Conference of the System Dynamics Society}, year = {2011}, author = {Oylum {\c S}eker and Yaman Barlas and Faruk Alag{\"o}l} } @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 {1479, title = {A sectoral decomposition analysis of Turkish CO2 emissions over 1990{\textendash}2007}, journal = {Energy}, volume = {36}, year = {2011}, pages = {2419-2433}, abstract = {

At a time of increased international concern and negotiations for greenhouse gas emission reduction, country studies on the underlying effects of greenhouse gas emission growth gain importance. The case of Turkey is particularly interesting due to rapidly growing emissions, accompanied by a political will and actions to reduce the quick growth. The refined Laspeyres method is used in this study to identify factors\ that accelerate or reduce the increase in Turkish CO2 emissions. A year-by-year decomposition over 1990{\textendash}2007 is carried out at sectoral level based on disaggregated data that is consistent over time and consistent with international standards. Various interesting results on the underlying effects of sectoral emission growth are found. Valuable insights are gained into CO2 impacts of sectoral policies including energy and emission intensities, fuel switching and activity changes. The results yield important hints for the planning of energy and climate policy.

}, keywords = {Carbon intensity, CO decomposition, Energy intensity, Sectoral emissions, Turkey}, issn = {0360-5442}, doi = {https://doi.org/10.1016/j.energy.2011.01.027}, url = {https://www.sciencedirect.com/science/article/pii/S0360544211000284}, author = {G{\"u}rkan Kumbaro{\u g}lu} } @article {aras2011selective, title = {Selective multi-depot vehicle routing problem with pricing}, journal = {Transportation Research Part C: Emerging Technologies}, volume = {19}, number = {5}, year = {2011}, pages = {866{\textendash}884}, publisher = {Elsevier}, author = {Necati Aras and Aksen, Deniz and Tu{\u g}rul Tekin, Mehmet} } @conference {tanyolacc2011soft, title = {A Soft Landing Model and a Mass Spring Damper Based Control Heuristic}, booktitle = {The 29th International System Dynamics Conference, Washington, DC, USA}, year = {2011}, publisher = {System Dynamics Society (http://www.systemdynamics.org/conferences/2011/index.htm)}, organization = {System Dynamics Society (http://www.systemdynamics.org/conferences/2011/index.htm)}, author = {Tanyola{\c c}, Togay and Yasarcan, Hakan} } @article {yasarcan2011stock, title = {Stock management in the presence of significant measurement delays}, journal = {System Dynamics Review}, volume = {27}, number = {1}, year = {2011}, pages = {91{\textendash}109}, publisher = {Wiley Online Library}, author = {Yasarcan, Hakan} } @conference {ekcsiouglusystems, title = {Systems-Based Approach to Safety and Health in the Small to Medium-sized Enterprises}, booktitle = {Proceedings of XIX World Congress on Safety and Health at Work}, year = {2011}, pages = {22{\textendash}23}, publisher = {http://app.csgb.gov.tr/isgum/safety2011turkey/kongresunumlaring.html}, organization = {http://app.csgb.gov.tr/isgum/safety2011turkey/kongresunumlaring.html}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {dingecc2011using, title = {Using the continuous price as control variate for discretely monitored options}, journal = {Mathematics and Computers in Simulation}, volume = {82}, number = {4}, year = {2011}, pages = {691{\textendash}704}, publisher = {North-Holland}, author = {Dinge{\c c}, Kemal Din{\c c}er and Wolfgang H{\"o}rmann} } @article {altinel2011variable, title = {Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem}, journal = {Journal of the Operational Research Society}, volume = {62}, number = {10}, year = {2011}, pages = {1813{\textendash}1826}, publisher = {Nature Publishing Group}, author = {I. Kuban Altinel and Necati Aras and {\"O}zk{\i}sac{\i}k, KC} } @article {1478, title = {What determines urban households{\textquoteright} willingness to pay for CO2 emission reductions in Turkey: A contingent valuation survey}, journal = {Energy Policy}, volume = {39}, year = {2011}, pages = {689-698}, abstract = {

This paper explores Turkish urban households{\textquoteright} willingness to pay (WTP) for CO2 emission reductions expected to result from improvements in power production. A face-to-face questionnaire, with a Contingent valuation (CV) module prepared using the double-bounded dichotomous choice elicitation framework, was administered to 2422 respondents representative of urban Turkey{\textemdash}a developing country with low but rapidly increasing greenhouse gas emissions. The determinants of WTP were identified by considering not only the impact of standard socio-economic factors but also the effects of environmental knowledge, attitudes and behaviour, the relevance of the identity of the collection agent (national versus international institutions) in terms of trust people have towards them, and the degree of perceived participation of others in the realization of the project. Our study confirms the existing literature in demonstrating that WTP figures reported by young and educated people that are active on environmental issues, and who also possess material security and environmental knowledge, are more likely to be high. However, their willingness to make contributions is hampered significantly by their belief that their fellow citizens will not contribute and the general lack of trust in institutions. Overall, this study may be taken as a call to eliminate governance-related uncertainties in climate change deals.

}, keywords = {Climate change, Contingent valuation, Turkey}, issn = {0301-4215}, doi = {https://doi.org/10.1016/j.enpol.2010.10.042}, url = {https://www.sciencedirect.com/science/article/pii/S0301421510007937}, author = {Fikret Adaman and Nihan Karal{\i} and G{\"u}rkan Kumbaro{\u g}lu and {\.I}lhan Or and Beg{\"u}m {\"O}zkaynak and {\"U}nal Zenginobuz} } @article {ekcsiouglu2011work, title = {Work-Related Musculoskeletal Disorders and Ergonomics}, journal = {Architect and Engineer}, number = {61}, year = {2011}, pages = {56{\textendash}59}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {aksen2010budget, title = {The budget constrained r-interdiction median problem with capacity expansion}, journal = {Central European Journal of Operations Research}, volume = {18}, number = {3}, year = {2010}, pages = {269{\textendash}291}, publisher = {Springer-Verlag}, author = {Aksen, Deniz and Piyade, Nuray and Necati Aras} } @article {13998331, title = {{A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks}}, journal = {European Journal of Operational Research}, volume = {207}, year = {2010}, pages = {1014{\textendash}1026}, doi = {10.1016/j.ejor.2010.05.020}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @conference {cseker2010controlling, title = {Controlling the Direction of a Model Helicopter}, booktitle = {The 28th International System Dynamics Conference, Seoul, Korea}, year = {2010}, publisher = {System Dynamics Society (http://www.systemdynamics.org/conferences/2010/index.htm)}, organization = {System Dynamics Society (http://www.systemdynamics.org/conferences/2010/index.htm)}, author = {Oylum {\c S}eker and Yasarcan, Hakan} } @article {aras2010designing, title = {Designing the reverse logistics network}, journal = {Closed-loop supply chains: new developments to improve the sustainability of business practices. Auerbach Publications}, year = {2010}, pages = {67{\textendash}97}, author = {Necati Aras and Boyaci, Tamer and Verter, Vedat and Ferguson, M and Souza, GC} } @conference {herdem2010dynamics, title = {Dynamics of Glucose-Insulin Regulation: Insulin Injection Regime for Patients with Diabetes Type 1}, booktitle = {The 28th International System Dynamics Conference, Seoul, Korea}, year = {2010}, publisher = {System Dynamics Society (http://www.systemdynamics.org/conferences/2010/index.htm)}, organization = {System Dynamics Society (http://www.systemdynamics.org/conferences/2010/index.htm)}, author = {Herdem, Canan and Yasarcan, Hakan} } @article {Yucel2010, title = {Dynamics of the North{\textendash}South welfare gap and global sustainability}, journal = {Technological Forecasting and Social Change}, volume = {77}, number = {4}, year = {2010}, pages = {594{\textendash}614}, publisher = {Elsevier Inc.}, keywords = {north, south welfare gap}, issn = {00401625}, doi = {10.1016/j.techfore.2009.11.004}, url = {http://linkinghub.elsevier.com/retrieve/pii/S0040162509001887}, author = {G{\"o}nen{\c c} Y{\"u}cel and Yaman Barlas} } @article {13288019, title = {{An efficient heuristic for placement, scheduling and routing in wireless sensor networks}}, journal = {Ad Hoc Networks}, volume = {8}, year = {2010}, pages = {654{\textendash}667}, doi = {10.1016/j.adhoc.2010.01.005}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @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} } @article {erol2010exploring, title = {Exploring reverse supply chain management practices in Turkey}, journal = {Supply Chain Management: An International Journal}, volume = {15}, number = {1}, year = {2010}, pages = {43{\textendash}54}, publisher = {Emerald Group Publishing Limited}, author = {Erol, Ismail and Velioglu, Meltem Nurtanis and Serifoglu, Funda Sivrikaya and B{\"u}y{\"u}k{\"o}zkan, G{\"u}l{\c c}in and Necati Aras and Cakar, Nigar Demircan and Aybek Korugan} } @book {13986675, title = {{A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model}}, series = {Hybrid Metaheuristics}, year = {2010}, pages = {31{\textendash}45}, doi = {10.1007/978-3-642-16054-7_3}, author = {Hande K{\"u}{\c c}{\"u}kaydin and Necati Aras and I. Kuban Altinel} } @article {yasarcan2010improving, title = {Improving understanding, learning, and performances of novices in dynamic managerial simulation games}, journal = {Complexity}, volume = {15}, number = {4}, year = {2010}, pages = {31{\textendash}42}, publisher = {John Wiley \& Sons, Ltd}, author = {Yasarcan, Hakan} } @conference {aras2010location, title = {Location and selective routing problem with pricing for the collection of used products}, booktitle = {Computers and Industrial Engineering (CIE), 2010 40th International Conference on}, year = {2010}, pages = {1{\textendash}6}, publisher = {IEEE}, organization = {IEEE}, author = {Necati Aras and Aksen, Deniz and Tekin, Tugrul} } @article {57723058, title = {{The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals}}, journal = {Iie Transactions}, volume = {42}, year = {2010}, pages = {825{\textendash}841}, doi = {10.1080/0740817X.2010.491504}, author = {M. Hakan Aky{\"u}z and Temel {\"O}ncan and I. Kuban Altinel} } @article {TaskinEtAl2010a, title = {Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning}, journal = {Operations Research}, volume = {58}, number = {3}, year = {2010}, pages = {674{\textendash}690}, doi = {http://dx.doi.org/10.1287/opre.1090.0759}, author = {Z C Ta{\c s}k{\i}n and J. Cole Smith and H. Edwin Romeijn and James F. Dempsey} } @article {turkougullari2010optimal, title = {Optimal placement, scheduling, and routing to maximize lifetime in sensor networks}, journal = {Journal of the Operational Research Society}, volume = {61}, number = {6}, year = {2010}, pages = {1000{\textendash}1012}, publisher = {Nature Publishing Group}, author = {T{\"u}rko{\u g}ullar{\i}, YB and Necati Aras and I. Kuban Altinel and Ersoy, Cem} } @article {ekim2010recognizing, title = {Recognizing line-polar bipartite graphs in time O (n)}, journal = {Discrete Applied Mathematics}, volume = {158}, number = {15}, year = {2010}, pages = {1593{\textendash}1598}, publisher = {Elsevier}, author = {Ekim, Tinaz and Huang, Jing} } @article {ekim2010split, title = {Split-critical and uniquely split-colorable graphs}, journal = {Discrete Mathematics and Theoretical Computer Science}, volume = {12}, number = {5}, year = {2010}, pages = {1{\textendash}24}, author = {Ekim, Tinaz and Ries, Bernard and de Werra, Dominique and others} } @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 {hormann2010t, title = {t-Copula generation for control variates}, journal = {Mathematics and Computers in Simulation}, volume = {81}, number = {4}, year = {2010}, pages = {782{\textendash}790}, publisher = {North-Holland}, author = {Wolfgang H{\"o}rmann and Sak, Halis} } @article {4756711, title = {{A comparative analysis of several asymmetric traveling salesman problem formulations}}, journal = {Computers \& Operations Research}, volume = {36}, year = {2009}, pages = {637{\textendash}654}, doi = {10.1016/j.cor.2007.11.008}, author = {Temel {\"O}ncan and I. Kuban Altinel and Gilbert Laporte} } @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 {TaskinEtAl2009a, title = {Cutting Plane Algorithms for Solving a Stochastic Edge-Partition Problem}, journal = {Discrete Optimization}, volume = {6}, number = {4}, year = {2009}, pages = {420-435}, doi = {http://dx.doi.org/10.1016/j.disopt.2009.05.004}, author = {Z C Ta{\c s}k{\i}n and J. Cole Smith and Shabbir Ahmed and Andrew J. Schaefer} } @article {aksen2009design, title = {Design and analysis of government subsidized collection systems for incentive-dependent returns}, journal = {International Journal of Production Economics}, volume = {119}, number = {2}, year = {2009}, pages = {308{\textendash}327}, publisher = {Elsevier}, author = {Aksen, Deniz and Necati Aras and Karaarslan, Ay{\c s}e G{\"o}n{\"u}l} } @article {4756751, title = {{Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations}}, journal = {Computers \& Operations Research}, volume = {36}, year = {2009}, pages = {2139{\textendash}2148}, doi = {10.1016/j.cor.2008.08.003}, author = {Engin Durmaz and Necati Aras and I. Kuban Altinel} } @book {47738327, title = {{Efficient Lower and Upper Bounds for the Multi-commodity Capacitated Multi-facility Weber Problem with Rectilinear Distances}}, series = {Logistik Management}, year = {2009}, doi = {10.1007/978-3-7908-2362-2_11}, author = {M. Hakan Aky{\"u}z and Temel {\"O}ncan and I. Kuban Altinel} } @conference {Derflinger;Hoermann;Leydold;Sak:2009a, title = {Efficient Numerical Inversion for Financial Simulations}, booktitle = {Monte Carlo and Quasi-Monte Carlo Methods 2008}, year = {2009}, pages = {297{\textendash}304}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Heidelberg}, author = {Derflinger, Gerhard and Wolfgang H{\"o}rmann and Leydold, Josef and Sak, Halis} } @article {ekcsiouglu2009iyi, title = {{\.I}yi Ergonomi {\.I}yi Ekonomidir}, journal = {End{\"u}stri {\.I}{\c s}letme M{\"u}hendisli{\u g}i Meslek Dal{\i} Ana Komisyonu B{\"u}lteni}, number = {129}, year = {2009}, pages = {22{\textendash}25}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {4778684, title = {{A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations}}, journal = {European Journal of Operational Research}, volume = {198}, year = {2009}, pages = {790{\textendash}799}, doi = {10.1016/j.ejor.2008.10.014}, author = {I. Kuban Altinel and Engin Durmaz and Necati Aras and Kerem Can {\"O}zkisacik} } @article {Yucel2009, title = {An objective-based perspective on assessment of model-supported policy processes}, journal = {Journal of Artificial Societies and Social Simulation}, volume = {12}, number = {4}, year = {2009}, pages = {3}, keywords = {model assessment, model typology, policy analysis, simulation, validation}, url = {http://jasss.soc.surrey.ac.uk/12/4/3.html}, author = {G{\"o}nen{\c c} Y{\"u}cel and van Daalen, Cornelia} } @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} } @article {1471, title = {Performance analysis of a hybrid system under quality impact of returns}, journal = {Computers \& Industrial Engineering}, volume = {56}, year = {2009}, month = {Mar}, pages = {507{\textendash}520}, issn = {03608352}, author = {Behret, H{\"u}lya and Aybek Korugan} } @inbook {Hoermann;Leydold:2009a, title = {Sampling from Linear Multivariate Densities}, booktitle = {Advancing the Frontiers of Simulation: A Festschrift in Honor of George Samuel Fishman}, year = {2009}, pages = {143{\textendash}152}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Heidelberg}, author = {Wolfgang H{\"o}rmann and Leydold, Josef} } @article {ozkisacik2009solving, title = {Solving probabilistic multi-facility Weber problem by vector quantization}, journal = {OR spectrum}, volume = {31}, number = {3}, year = {2009}, pages = {533{\textendash}554}, publisher = {Springer-Verlag}, author = {{\"O}zk{\i}sac{\i}k, Kerem Can and I. Kuban Altinel and Necati Aras} } @booklet {erdincc2009student, title = {Student Specific Cornell Musculoskeletal Discomfort Questionnaires (SS-CMDQ) (Turkish)}, journal = {http://ergo.human.cornell.edu/ahSSCMDQquestTurkish.html}, year = {2009}, author = {Erdin{\c c}, O{\u g}uzhan and Mahmut Ek{\c s}io{\u g}lu} } @booklet {erdincc2009student, title = {Student Specific Cornell Musculoskeletal Discomfort Questionnaires (SS-CMDQ) (English)}, journal = {http://ergo.human.cornell.edu/ahSSCMDQquest.html}, year = {2009}, author = {Erdin{\c c}, O{\u g}uzhan and Mahmut Ek{\c s}io{\u g}lu} } @article {TaskinUnal2009, title = {Tactical Level Planning in Float Glass Manufacturing with Co-Production, Random Yields and Substitutable Products}, journal = {European Journal of Operational Research}, volume = {199}, number = {1}, year = {2009}, pages = {252-261}, doi = {http://dx.doi.org/10.1016/j.ejor.2008.11.024}, author = {Z C Ta{\c s}k{\i}n and Ali Tamer {\"U}nal} } @article {34, title = {Toward Development of Adaptive Service-Based Software Systems}, journal = {IEEE Transactions on Services Computing}, volume = {2}, year = {2009}, pages = {247-260}, abstract = {

The rapid adoption of service-oriented architecture (SOA) in many large-scale distributed applications requires the development of adaptive service-based software systems (ASBS) with the capability of monitoring the changing system status, analyzing, and controlling tradeoffs among various quality-of-service (QoS) aspects, and adapting service configurations to satisfy multiple QoS requirements simultaneously. In this paper, our results toward the development of adaptive service-based software systems are presented. The formulation of activity-state-QoS (ASQ) models and how to use the data from controlled experiments to establish ASQ models for capturing the cause-effect dynamics among service activities, system resource states, and QoS in service-based systems are presented. Then, QoS monitoring modules based on ASQ models and SOA-compliant simulation models are developed to support the validation of the ASBS design. The main idea for developing QoS adaptation modules based on ASQ models is discussed. An experiment based on a voice communication service is used to illustrate our results.

}, keywords = {Design concepts, distributed/Internet-based software engineering tools and techniques, methodologies, modeling methodologies, quality of services, services systems}, issn = {1939-1374}, doi = {http://doi.ieeecomputersociety.org/10.1109/TSC.2009.17}, author = {Stephen S. Yau and Nong Ye and Hessam S. Sarjoughian and Dazhi Huang and Auttawut Roontiva and Mustafa Gokce Baydogan and Mohammed A. Muqsith} } @article {demange2009tutorial, title = {A tutorial on the use of graph coloring for some problems in robotics}, journal = {European Journal of Operational Research}, volume = {192}, number = {1}, year = {2009}, pages = {41{\textendash}55}, publisher = {North-Holland}, author = {Demange, Marc and Ekim, Tinaz and de Werra, Dominique} } @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 {cherng2009vibration, title = {Vibration reduction of pneumatic percussive rivet tools: mechanical and ergonomic re-design approaches}, journal = {Applied ergonomics}, volume = {40}, number = {2}, year = {2009}, pages = {256{\textendash}266}, publisher = {Elsevier}, author = {Cherng, John G and Mahmut Ek{\c s}io{\u g}lu and K{\i}z{\i}laslan, Kemal} } @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 {1480, title = {CO2, GDP and RET: An aggregate economic equilibrium analysis for Turkey}, journal = {Energy Policy}, volume = {36}, year = {2008}, pages = {2694-2708}, abstract = {

There is a worldwide interest in renewable electricity technologies (RETs) due to growing concerns about global warming and climate change. As an EU candidate country whose energy demand increases exponentially, Turkey inevitably shares this common interest on RET. This study, using an aggregate economic equilibrium model, explores the economic costs of different policy measures to mitigate CO2 emissions in Turkey. The model combines energy demands, capital requirements and labor inputs at a constant elasticity of substitution under an economy-wide nested production function. Growing energy demand, triggered by economic growth, is met by increased supply and initiates new capacity additions. Investment into RET is encouraged via the incorporation of (a) endogenous technological learning through which the RET cost declines as a function of cumulative capacity, and (b) a willingness to pay (WTP) function which imposes the WTP of consumers as a lower bound on RET installation. The WTP equation is obtained as a function of consumer income categories, based on data gathered from a pilot survey in which the contingent valuation methodology was employed. The impacts of various emission reduction scenarios on GDP growth and RET diffusion are explored. As expected, RET penetration is accelerated under faster technological learning and higher WTP conditions. It is found that stabilizing CO2 emissions to year 2005 levels causes economic losses amounting to 17\% and 23\% of GDP in the years 2020 and 2030, respectively.

}, keywords = {Energy and environmental policy modeling, Learning (experience) curves, Willingness to pay for CO emission reduction}, issn = {0301-4215}, doi = {https://doi.org/10.1016/j.enpol.2008.03.026}, url = {https://www.sciencedirect.com/science/article/pii/S030142150800164X}, author = {G{\"u}rkan Kumbaro{\u g}lu and Nihan Karal{\i} and Y{\i}ld{\i}z Ar{\i}kan} } @inbook {barlas2008comprehensive, title = {A comprehensive model of goal dynamics in organizations: setting, evaluation and revision}, booktitle = {Complex Decision Making}, year = {2008}, pages = {295{\textendash}320}, publisher = {Springer}, organization = {Springer}, author = {Barlas, Yaman and Yasarcan, Hakan} } @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} } @proceedings {nisa4, title = {A Dynamic Simulation Model of Academic Publications and Citations}, journal = {26th International Conference of the System Dynamics Society}, year = {2008}, author = {K{\"u}{\c c}{\"u}k, B. and Nisa {\"O}nsel and B. Eskici} } @article {oner2008economic, title = {Economic lot scheduling with uncontrolled co-production}, journal = {European Journal of Operational Research}, volume = {188}, number = {3}, year = {2008}, pages = {793{\textendash}810}, publisher = {Elsevier}, author = {{\"O}ner, Selma and Taner Bilgi{\c c}} } @conference {50713928, title = {{An efficient heuristic for placement, scheduling and routing in wireless sensor networks}}, booktitle = {International Symposium on Computer and Information Sciences}, year = {2008}, doi = {10.1109/ISCIS.2008.4717856}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @article {aras2008efficient, title = {Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem}, journal = {Journal of the Operational Research Society}, volume = {59}, number = {1}, year = {2008}, pages = {64{\textendash}79}, publisher = {Nature Publishing Group}, author = {Necati Aras and Orbay, M and I. Kuban Altinel} } @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 {4777890, title = {{Exact solution procedures for the balanced unidirectional cyclic layout problem}}, journal = {European Journal of Operational Research}, volume = {189}, year = {2008}, pages = {609{\textendash}623}, doi = {10.1016/j.ejor.2006.09.094}, author = {Temel {\"O}ncan and I. Kuban Altinel} } @conference {ekcsiouglu2008isometric, title = {Isometric grip strength distribution of a Turkish sample}, booktitle = {Proceedings of the XX Annual International Occupational Ergonomics and Safety Conference}, year = {2008}, pages = {20{\textendash}24}, publisher = {International Society of Occupational Ergonomics and Safety ISBN \# 97809654506-4-5}, organization = {International Society of Occupational Ergonomics and Safety ISBN \# 97809654506-4-5}, author = {Mahmut Ek{\c s}io{\u g}lu and Silahl{\i}, Baykar} } @article {Aras2008a, title = {Locating collection centers for distance-and incentive-dependent returns}, journal = {International Journal of Production Economics}, volume = {111}, number = {2}, year = {2008}, pages = {316{\textendash}333}, publisher = {Elsevier}, author = {Necati Aras and Aksen, Deniz} } @article {Aras2008, title = {Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles}, journal = {European Journal of Operational Research}, volume = {191}, number = {3}, year = {2008}, pages = {1223{\textendash}1240}, publisher = {Elsevier}, author = {Necati Aras and Aksen, Deniz and G{\"o}n{\"u}l Tanu{\u g}ur, Ay{\c s}e} } @article {FBE-IE-02-2008-02, title = {Measurement, Analysis and Evaluation of Academic Publications and Citations}, number = {FBE-IE-02/2008-02}, year = {2008}, institution = {Bo{\u g}azi{\c c}i University}, author = {Yaman Barlas and B. K{\"u}{\c c}{\"u}k and Nisa {\"O}nsel and A. S. Kocaman} } @article {demange2008minimum, title = {Minimum maximal matching is NP-hard in regular bipartite graphs}, journal = {Theory and Applications of Models of Computation}, year = {2008}, pages = {364{\textendash}374}, publisher = {Springer}, author = {Demange, Marc and Ekim, Tinaz} } @article {kayics2008note, title = {A note on the can-order policy for the two-item stochastic joint-replenishment problem}, journal = {IIE Transactions}, volume = {40}, number = {1}, year = {2008}, pages = {84{\textendash}92}, publisher = {Taylor \& Francis}, author = {Kayi{\c s}, Enis and Taner Bilgi{\c c} and Karabulut, Deniz} } @article {4777558, title = {{Optimum component test plans for phased-mission systems}}, journal = {European Journal of Operational Research}, volume = {185}, year = {2008}, pages = {255{\textendash}265}, doi = {10.1016/j.ejor.2007.01.053}, author = {Orhan Feyzioglu and I. Kuban Altinel and S{\"u}leyman {\"O}zekici} } @article {bilge2008parametric, title = {A parametric fuzzy logic approach to dynamic part routing under full routing flexibility}, journal = {Computers \& Industrial Engineering}, volume = {55}, number = {1}, year = {2008}, pages = {15{\textendash}33}, publisher = {Elsevier}, author = {{\"U}mit Bilge and F{\i}rat, Murat and Albey, Erin{\c c}} } @article {ekim2008polar, title = {Polar cographs}, journal = {Discrete Applied Mathematics}, volume = {156}, number = {10}, year = {2008}, pages = {1652{\textendash}1660}, publisher = {North-Holland}, author = {Ekim, Tinaz and Mahadev, Nadimpalli VR and de Werra, Dominique} } @article {ekim2008polarity, title = {Polarity of chordal graphs}, journal = {Discrete Applied Mathematics}, volume = {156}, number = {13}, year = {2008}, pages = {2469{\textendash}2479}, publisher = {Elsevier}, author = {Ekim, Tinaz and Hell, Pavol and Stacho, Juraj and de Werra, Dominique} } @article {1481, title = {A real options evaluation model for the diffusion prospects of new renewable power generation technologies}, journal = {Energy Economics}, volume = {30}, year = {2008}, pages = {1882-1908}, abstract = {

This study presents a policy planning model that integrates learning curve information on renewable power generation technologies into a dynamic programming formulation featuring real options analysis. The model recursively evaluates a set of investment alternatives on a year-by-year basis, thereby taking into account that the flexibility to delay an irreversible investment expenditure can profoundly affect the diffusion prospects of renewable power generation technologies. Price uncertainty is introduced through stochastic processes for the average wholesale price of electricity and for input fuel prices. Demand for electricity is assumed to be increasingly price-sensitive, as the electricity market deregulation proceeds, reflecting new options of consumers to react to electricity price changes (such as time-of-use pricing, unbundled electricity services, and choice of supplier). The empirical analysis is based on data for the Turkish electricity supply industry. Apart from general implications for policy-making, it provides some interesting insights about the impact of uncertainty and technical change on the diffusion of various emerging renewable energy technologies.

}, keywords = {Dynamic programming, Investment planning, Learning curve, Real options, Renewable energy technology diffusion, Turkey}, issn = {0140-9883}, doi = {https://doi.org/10.1016/j.eneco.2006.10.009}, url = {https://www.sciencedirect.com/science/article/pii/S0140988306001241}, author = {G{\"u}rkan Kumbaro{\u g}lu and Reinhard Madlener and Mustafa Demirel} } @article {eksioglu2008steering, title = {Steering-wheel grip force characteristics of drivers as a function of gender, speed, and road condition}, journal = {International journal of industrial ergonomics}, volume = {38}, number = {3}, year = {2008}, pages = {354{\textendash}361}, publisher = {Elsevier}, author = {Mahmut Ek{\c s}io{\u g}lu and K{\i}z{\i}laslan, Kemal} } @article {Yucel2008, title = {Studying transition dynamics via focusing on underlying feedback interactions}, journal = {Computational and Mathematical Organization Theory}, volume = {14}, number = {4}, year = {2008}, pages = {320{\textendash}349}, issn = {1381-298X}, doi = {10.1007/s10588-008-9032-4}, url = {http://www.springerlink.com/index/10.1007/s10588-008-9032-4}, author = {G{\"o}nen{\c c} Y{\"u}cel and Chiong Meza, Catherine Miluska} } @article {ccanakouglu2007analysis, title = {Analysis of a two-stage telecommunication supply chain with technology dependent demand}, journal = {European Journal of Operational Research}, volume = {177}, number = {2}, year = {2007}, pages = {995{\textendash}1012}, publisher = {North-Holland}, author = {Canako{\u g}lu, Ethem and Taner Bilgi{\c c}} } @conference {ekcsiouglu2007automobile, title = {Automobile drivers{\textquoteright} steering force characteristics}, booktitle = {Proceedings of 37th International Conference on Computers and Industrial Engineering}, number = {590-594}, year = {2007}, author = {Mahmut Ek{\c s}io{\u g}lu and K{\i}z{\i}laslan, Kemaal} } @article {MenEtAl2007, title = {An Exact Approach to Direct Aperture Optimization in IMRT Treatment Planning}, journal = {Physics in Medicine and Biology}, volume = {52}, number = {24}, year = {2007}, pages = {7333-7352}, doi = {http://dx.doi.org/10.1088/0031-9155/52/24/009}, author = {Chunhua Men and H. Edwin Romeijn and Z C Ta{\c s}k{\i}n and James F. Dempsey} } @article {aras2007new, title = {New heuristic methods for the capacitated multi-facility Weber problem}, journal = {Naval Research Logistics (NRL)}, volume = {54}, number = {1}, year = {2007}, pages = {21{\textendash}32}, publisher = {Wiley Online Library}, author = {Necati Aras and I. Kuban Altinel and Orbay, Metin} } @article {aksen2007open, title = {Open vehicle routing problem with driver nodes and time deadlines}, journal = {Journal of the Operational Research Society}, volume = {58}, number = {9}, year = {2007}, pages = {1223{\textendash}1234}, publisher = {Nature Publishing Group}, author = {Aksen, D and {\"O}zyurt, Z and Necati Aras} } @conference {50632893, title = {{Optimal placement and activity scheduling to maximize coverage lifetime in wireless sensor networks}}, booktitle = {International Symposium on Computer and Information Sciences}, year = {2007}, doi = {10.1109/ISCIS.2007.4456874}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @article {Hoermann:2007a, title = {A simple Generator for the t-Distribution}, journal = {Computing}, volume = {81}, year = {2007}, author = {Wolfgang H{\"o}rmann} } @inbook {aras2007solving, title = {Solving the capacitated multi-facility Weber problem by simulated annealing, threshold accepting and genetic algorithms}, booktitle = {Metaheuristics}, year = {2007}, pages = {91{\textendash}112}, publisher = {Springer US}, organization = {Springer US}, author = {Necati Aras and Yumusak, Sadettin and I. Kuban Altinel} } @article {bilge2007tabu, title = {A tabu search algorithm for the single machine total weighted tardiness problem}, journal = {European Journal of Operational Research}, volume = {176}, number = {3}, year = {2007}, pages = {1423{\textendash}1435}, publisher = {Elsevier}, author = {{\"U}mit Bilge and Kurtulan, M{\"u}jde and K{\i}ra{\c c}, Furkan} } @article {demange2006approximation, title = {On the approximation of Min Split-coloring and Min Cocoloring.}, journal = {J. Graph Algorithms Appl.}, volume = {10}, number = {2}, year = {2006}, pages = {297{\textendash}315}, author = {Demange, Marc and Ekim, Tinaz and de Werra, Dominique and others} } @conference {Hoermann;Leydold:2006a, title = {Black-Box Algorithms for Sampling from Continuous Distributions}, booktitle = {Proceedings of the 2006 Winter Simulation Conference}, year = {2006}, pages = {129{\textendash}136}, author = {Wolfgang H{\"o}rmann and Leydold, Josef} } @article {de2006construction, title = {Construction of sports schedules with multiple venues}, journal = {Discrete Applied Mathematics}, volume = {154}, number = {1}, year = {2006}, pages = {47{\textendash}58}, publisher = {North-Holland}, author = {de Werra, Dominique and Ekim, Tinaz and Raess, C} } @article {aras2006coordination, title = {Coordination and priority decisions in hybrid manufacturing/remanufacturing systems}, journal = {Production and Operations Management}, volume = {15}, number = {4}, year = {2006}, pages = {528{\textendash}543}, publisher = {Wiley Online Library}, author = {Necati Aras and Verter, Vedat and Boyaci, Tamer} } @inbook {aksen2006customer, title = {Customer selection and profit maximization in vehicle routing problems}, booktitle = {Operations Research Proceedings 2005}, year = {2006}, pages = {37{\textendash}42}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {Aksen, Deniz and Necati Aras} } @article {2526247, title = {{The design of optimum component test plans for system reliability}}, journal = {Computational Statistics \& Data Analysis}, volume = {50}, year = {2006}, pages = {3099{\textendash}3112}, doi = {10.1016/j.csda.2005.06.015}, author = {Orhan Feyzioglu and I. Kuban Altinel and S{\"u}leyman {\"O}zekici} } @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} } @proceedings {kizilaslaneffects, title = {EFFECTS OF FREQUENCY, GRIP FORCE, AND GENDER ON THE PERCEPTION OF STEERING WHEEL LONGITUDINAL VIBRATION}, year = {2006}, author = {K{\i}z{\i}laslan, Kemal and Mahmut Ek{\c s}io{\u g}lu and Amman, Scott A} } @article {barlas2006goal, title = {Goal setting, evaluation, learning and revision: A dynamic modeling approach}, journal = {Evaluation and Program Planning}, volume = {29}, number = {1}, year = {2006}, pages = {79{\textendash}87}, publisher = {Elsevier}, author = {Barlas, Yaman and Yasarcan, Hakan} } @article {bilge2006multi, title = {Multi-attribute responsive dispatching strategies for automated guided vehicles}, journal = {International Journal of Production Economics}, volume = {100}, number = {1}, year = {2006}, pages = {65{\textendash}75}, publisher = {Elsevier}, author = {{\"U}mit Bilge and Esenduran, G{\"o}k{\c c}e and Varol, Nebibe and {\"O}zt{\"u}rk, Zeynep and Ayd{\i}n, Burcu and Alp, Aysun} } @inbook {ozyurt2006open, title = {Open vehicle routing problem with time deadlines: Solution methods and an application}, booktitle = {Operations Research Proceedings 2005}, year = {2006}, pages = {73{\textendash}78}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {{\"O}zyurt, Zeynep and Aksen, Deniz and Necati Aras} } @article {eksioglu2006optimal, title = {Optimal work{\textendash}rest cycles for an isometric intermittent gripping task as a function of force, posture and grip span}, journal = {Ergonomics}, volume = {49}, number = {2}, year = {2006}, pages = {180{\textendash}201}, publisher = {Taylor \& Francis}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {aras2006solving, title = {Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps}, journal = {Journal of the Operational Research Society}, volume = {57}, number = {1}, year = {2006}, pages = {82{\textendash}93}, publisher = {Nature Publishing Group}, author = {Necati Aras and {\"O}zk{\i}sac{\i}k, KC and I. Kuban Altinel} } @article {ekim2006split, title = {On split-coloring problems (vol 10, pg 211, 2005)}, journal = {JOURNAL OF COMBINATORIAL OPTIMIZATION}, volume = {11}, number = {1}, year = {2006}, pages = {125{\textendash}125}, publisher = {SPRINGER VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS}, author = {Ekim, Tinaz and de Werra, Dominique} } @article {Derflinger;Hoermann:2005a, title = {Asymptotically Optimal Design Points for Rejection Algorithms}, journal = {Communications in Statistics: Simulation and Computation}, volume = {34}, number = {4}, year = {2005}, pages = {879-893}, author = {Derflinger, Gerhard and Wolfgang H{\"o}rmann} } @conference {ekcsiouglu2005ergonomic, title = {Ergonomic Evaluation Of OCS Audit Station}, booktitle = {Proceedings of XIX Annual International Occupational Ergonomics and Safety Conference (CD-ROM)}, year = {2005}, pages = {403{\textendash}409}, author = {Mahmut Ek{\c s}io{\u g}lu and Lammers, E and Dye, S and Raftery, R} } @article {yasarcan2005generalized, title = {A generalized stock control formulation for stock management problems involving composite delays and secondary stocks}, journal = {System dynamics review}, volume = {21}, number = {1}, year = {2005}, pages = {33{\textendash}68}, publisher = {Wiley Online Library}, author = {Yasarcan, Hakan and Barlas, Yaman} } @article {1482, title = {Modeling Technology Adoption as an Irreversible Investment under Uncertainty the Case of the Turkish Electricity Supply Industry}, journal = {Energy Economics}, volume = {27}, year = {2005}, month = {Jan}, pages = {139{\textendash}163}, author = {Madlener, Reinhard and G{\"u}rkan Kumbaro{\u g}lu and ED{\.I}GER, {\c S}EVKET VOLKAN} } @conference {Hoermann;Leydold:2005a, title = {Monte Carlo Integration Using Importance Sampling and Gibbs Sampling}, booktitle = {Proceedings of the International Conference on Computational Science and Engineering}, year = {2005}, pages = {92{\textendash}97}, author = {Wolfgang H{\"o}rmann and Leydold, Josef} } @article {ray2005optimal, title = {Optimal prices and trade-in rebates for durable, remanufacturable products}, journal = {Manufacturing \& Service Operations Management}, volume = {7}, number = {3}, year = {2005}, pages = {208{\textendash}228}, publisher = {INFORMS}, author = {Ray, Saibal and Boyaci, Tamer and Necati Aras} } @article {demange2005p, title = {(p, k)-coloring problems in line graphs}, journal = {Theoretical computer science}, volume = {349}, number = {3}, year = {2005}, pages = {462{\textendash}474}, publisher = {Elsevier}, author = {Demange, Marc and Ekim, Tinaz and de Werra, Dominique} } @article {demange2005partitioning, title = {Partitioning cographs into cliques and stable sets}, journal = {Discrete Optimization}, volume = {2}, number = {2}, year = {2005}, pages = {145{\textendash}153}, publisher = {Elsevier}, author = {Demange, Marc and Ekim, Tinaz and de Werra, Dominique} } @article {ekim2005split, title = {On split-coloring problems}, journal = {Journal of Combinatorial Optimization}, volume = {10}, number = {3}, year = {2005}, pages = {211{\textendash}225}, publisher = {Kluwer Academic Publishers}, author = {Ekim, Tinaz and de Werra, Dominique} } @conference {yasarcan2005stable, title = {Stable stock management heuristics when the outflow is proportional to the control stock}, booktitle = {The 23rd International System Dynamics Conference, Boston, MA, USA}, year = {2005}, publisher = {System Dynamics Society (http://www.systemdynamics.org/conferences/2005/index.htm)}, organization = {System Dynamics Society (http://www.systemdynamics.org/conferences/2005/index.htm)}, author = {Yasarcan, Hakan and Barlas, Yaman} } @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 {ekggouglu11uygulanan, title = {Uygulanan Kuvvet, Elkavrama Aral{\i}{\u g}{\i} ve Omuz Duru{\c s}unun Maksimal Kabul Edilebilir {\.I}zometrik ve Kesikli El Kontraksiyon Frekans{\i}na Etkileri}, journal = {11. Ulusal Ergonomi Kongresi}, year = {2005}, pages = {67}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {eksioglu20042, title = {A 2-D Biomechanical Analysis of Microgravity Induced Neutral Body Posture in one-g Environment}, journal = {IIE Annual Conference. Proceedings}, year = {2004}, pages = {1}, publisher = {Institute of Industrial Engineers-Publisher}, author = {Mahmut Ek{\c s}io{\u g}lu and K{\i}z{\i}laslan, Kemal} } @conference {ekcsiouglu20042, title = {A 2-D biomechanical analysis of zero-gravity neutral posture in one-g environment}, booktitle = {Proceedings of 13th IIE Annual Conference (CD- ROM)}, year = {2004}, author = {Mahmut Ek{\c s}io{\u g}lu and K{\i}z{\i}laslan, Kemal} } @article {ekim2004approximation, title = {Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa}, journal = {International Journal of Computer Mathematics}, volume = {81}, number = {5}, year = {2004}, pages = {569{\textendash}582}, publisher = {Taylor \& Francis Group}, author = {Ekim, Tinaz and Paschos, Vangelis Th} } @book {724, title = {Automatic Nonuniform Random Variate Generation}, year = {2004}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin Heidelberg}, author = {Wolfgang H{\"o}rmann and Leydold, Josef and Derflinger, Gerhard} } @article {aras2004effect, title = {The effect of categorizing returned products in remanufacturing}, journal = {IIE Transactions}, volume = {36}, number = {4}, year = {2004}, pages = {319{\textendash}331}, publisher = {Taylor \& Francis}, author = {Necati Aras and Boyaci, Tamer and Verter, Vedat} } @article {Tirler;etal:2004a, title = {An Error in the {Kinderman-Ramage} Method and How to Fix It}, journal = {Computational Statistics and Data Analysis}, volume = {47}, number = {3}, year = {2004}, pages = {433{\textendash}440}, author = {Tirler, G{\"u}nter and Dalgaard, Peter and Wolfgang H{\"o}rmann and Leydold, Josef} } @article {56229753, title = {{Product-line selection and pricing with remanufacturing under availability constraints}}, volume = {5583}, year = {2004}, pages = {244{\textendash}255}, doi = {10.1117/12.572218}, author = {Necati Aras and G{\"o}k{\c c}e Esenduran and I. Kuban Altinel} } @article {eksioglu2004relative, title = {Relative optimum grip span as a function of hand anthropometry}, journal = {International Journal of Industrial Ergonomics}, volume = {34}, number = {1}, year = {2004}, pages = {1{\textendash}12}, publisher = {Elsevier}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {Leydold;Hoermann:2004b, title = {Smoothed Transformed Density Rejection}, journal = {Monte Carlo Methods and Applications}, volume = {10}, number = {3{\textendash}4}, year = {2004}, pages = {393{\textendash}402}, author = {Leydold, Josef and Wolfgang H{\"o}rmann} } @article {bilge2004tabu, title = {A tabu search algorithm for parallel machine total tardiness problem}, journal = {Computers \& Operations Research}, volume = {31}, number = {3}, year = {2004}, pages = {397{\textendash}414}, publisher = {Elsevier}, author = {{\"U}mit Bilge and K{\i}ra{\c c}, Furkan and Kurtulan, M{\"u}jde and Pekg{\"u}n, Pelin} } @article {Leydold;etal:2003a, title = {An Automatic Code Generator for Nonuniform Random Variate Generation}, journal = {Mathematics and Computers in Simulation}, volume = {62}, number = {3{\textendash}6}, year = {2003}, pages = {405{\textendash}412}, author = {Leydold, Josef and Derflinger, Gerhard and Tirler, G{\"u}nter and Wolfgang H{\"o}rmann} } @article {Hoermann;Leydold:2003a, title = {Continuous Random Variate Generation by Fast Numerical Inversion}, journal = {ACMTOMACS}, volume = {13}, number = {4}, year = {2003}, pages = {347{\textendash}362}, author = {Wolfgang H{\"o}rmann and Leydold, Josef} } @article {1484, title = {Energy and Climate Policy Analysis with the Hybrid Bottom Up Computable General Equilibrium Model SCREEN The Case of the Swiss CO2 Act}, journal = {Annals of Operations Research}, volume = {121}, year = {2003}, month = {Jul}, pages = {181{\textendash}203}, author = {G{\"u}rkan Kumbaro{\u g}lu and Madlener, Reinhard} } @article {1483, title = {Environmental Taxation and Economic Effects A Computable General Equilibrium Analysis for Turkey}, journal = {Journal of Policy Modeling}, volume = {25}, year = {2003}, month = {Nov}, pages = {795{\textendash}810}, author = {G{\"u}rkan Kumbaro{\u g}lu} } @conference {yasarcan2003general, title = {A general stock control formulation for stock management problems involving delays and secondary stocks}, booktitle = {The 21st International System Dynamics Conference, New York City, USA}, year = {2003}, publisher = {System Dynamics Society (http://www.systemdynamics.org/conferences/2003/index.htm)}, organization = {System Dynamics Society (http://www.systemdynamics.org/conferences/2003/index.htm)}, author = {Yasarcan, Hakan and Barlas, Yaman} } @article {1217349, title = {{A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE}}, journal = {IEEE Transactions on Neural Networks}, volume = {14}, year = {2003}, pages = {869{\textendash}890}, doi = {10.1109/TNN.2003.811562}, author = {Necati Aras and I. Kuban Altinel and John Oommen} } @article {eksioglu2003minimizing, title = {Minimizing $\alpha$ and $\beta$ Errors in Detection Tasks}, journal = {IIE Annual Conference. Proceedings}, year = {2003}, pages = {1}, publisher = {Institute of Industrial Engineers-Publisher}, author = {Mahmut Ek{\c s}io{\u g}lu and Chen, Guangming} } @conference {ekcsiouglu2003minimizing, title = {Minimizing $\alpha$ and $\beta$ errors in detection tasks}, booktitle = {Proceedings of 12th Annual Industrial Engineering Research Conference (CD-ROM)}, year = {2003}, author = {Mahmut Ek{\c s}io{\u g}lu and Chen, G} } @conference {altmel2003self, title = {A self-organizing method for map reconstruction}, booktitle = {Neural Networks for Signal Processing, 2003. NNSP{\textquoteright}03. 2003 IEEE 13th Workshop on}, year = {2003}, pages = {677{\textendash}687}, publisher = {IEEE}, organization = {IEEE}, author = {I. Kuban Altinel and Necati Aras and Oommen, BJ} } @article {14086928, title = {{A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries}}, journal = {European Journal of Operational Research}, volume = {137}, year = {2002}, pages = {483{\textendash}496}, doi = {10.1016/S0377-2217(01)00066-2}, author = {Murat Draman and I. Kuban Altinel and Nijaz Bajgoric and Ali Tamer {\"U}nal and Burak Birg{\"o}ren} } @article {Hoermann;Derflinger:2002a, title = {Fast Generation of Order Statistics}, journal = {ACMTOMACS}, volume = {12}, number = {2}, year = {2002}, pages = {83{\textendash}93}, abstract = {

Generating a single order statistic without generating the full sample can be an important task for simulations. If the density and the CDF of the distribution are given, then it is no problem to compute the density of the order statistic. In the main theorem it is shown that the concavity properties of that density depend directly on the distribution itself. Especially for log-concave distributions, all order statistics have log-concave distributions themselves. So recently suggested automatic transformed density rejection algorithms can be used to generate single order statistics. This idea leads to very fast generators. For example for the normal and gamma distributions, the suggested new algorithms are between 10 and 60 times faster than the algorithms suggested in the literature.

}, keywords = {black box, order statistics, T-concave, TDR}, author = {Wolfgang H{\"o}rmann and Derflinger, Gerhard} } @article {Hoermann:2002a, title = {A note on the Performance of the {\textquoteleft}{\textquoteleft}{A}hrens Algorithm{\textquoteright}{\textquoteright}}, journal = {Computing}, volume = {69}, year = {2002}, pages = {83{\textendash}89}, author = {Wolfgang H{\"o}rmann} } @article {866098, title = {{Some aspects of using CASE tools in a Fusion-based application development project for production optimization}}, journal = {Industrial Management and Data Systems}, volume = {102}, year = {2002}, pages = {463{\textendash}471}, doi = {10.1108/02635570210445899}, author = {Nijaz Bajgoric and I. Kuban Altinel and Murat Draman and Ali Tamer {\"U}nal} } @conference {Leydold;Janka;Hoermann:2002a, title = {Variants of Transformed Density Rejection and Correlation Induction}, booktitle = {Monte Carlo and Quasi-Monte Carlo Methods 2000}, year = {2002}, pages = {345{\textendash}356}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Heidelberg}, author = {Leydold, Josef and Janka, Erich and Wolfgang H{\"o}rmann} } @article {48044444, title = {{Dynamic component testing of a series system with redundant subsystems}}, journal = {Iie Transactions}, volume = {33}, year = {2001}, pages = {1093{\textendash}1108}, doi = {10.1023/A:1010922720237}, author = {I. Kuban Altinel and S{\"u}leyman {\"O}zekici} } @article {1485, title = {Endogenising emission taxes: A general equilibrium type optimisation model applied for Turkey}, journal = {Energy Policy}, volume = {29}, year = {2001}, pages = {1045-1056}, abstract = {

This paper presents a modelling attempt to endogenise the level and timing of environmental taxes within an optimisation framework. First, a base model of energy{\textendash}economy{\textendash}environmental interactions is extended to allow for exogenous tax analysis. Two types of environmental taxes, one on the sulphur content of fuels and the other on the level of emissions, are exogenously included in the model as alternative instruments to mitigate pollution. Next, the base model is modified to endogenise pollution abatement. This has been achieved by incorporating a preference rate, depending on an index of emissions, into the utility function. Finally, the emission index and emission tax are taken as substitutes and modelled within a CES form to endogenise the emission tax. Results for all cases, obtained with Turkish data, are discussed. It is found that a tax on SO2 emissions is more effective in reducing SO2 emissions than a tax applied on the sulphur content of fuels. It is also found that a gradually increasing tax is more effective in reducing emissions than a constant tax.

}, keywords = {Emission taxation, Endogenous pollution abatement, Energy{\textendash}economy modelling}, issn = {0301-4215}, doi = {https://doi.org/10.1016/S0301-4215(01)00032-5}, url = {https://www.sciencedirect.com/science/article/pii/S0301421501000325}, author = {Y{\i}ld{\i}z Ar{\i}kan and G{\"u}rkan Kumbaro{\u g}lu} } @conference {zhuang2001ergonomic, title = {Ergonomic evaluation of a prototype assistive device for moving residents up in bed}, booktitle = {Proceedings of the 6th Annual International Conference on Industrial Engineering-Theory, Applications and Practice (CD-ROM)}, year = {2001}, author = {Zhuang, Ziqing and Mahmut Ek{\c s}io{\u g}lu} } @article {14553068, title = {{General continuous time models for production planning and scheduling of batch processing plants: mixed integer linear program formulations and computational issues}}, journal = {Computers \& Chemical Engineering}, volume = {25}, year = {2001}, pages = {371{\textendash}389}, doi = {10.1016/S0098-1354(00)00663-3}, author = {Seza Or{\c c}un and I. Kuban Altinel and {\"O}ner Horta{\c c}su} } @article {59469243, title = {{A general software testing model involving operational profiles}}, volume = {15}, year = {2001}, pages = {519{\textendash}533}, author = {S{\"u}leyman {\"O}zekici and I. Kuban Altinel and M. E. Angun} } @conference {ekcsiouglu2001model, title = {A model for impairment evaluation of the wrist due to the loss of wrist range of motion}, booktitle = {Proceedings of the 6th Annual International Conference on Industrial Engineering{\textendash}Theory, Applications, and Practice (CD-ROM)}, year = {2001}, author = {Mahmut Ek{\c s}io{\u g}lu and Fernandez, Jeffrey E} } @conference {Leydold;Hoermann:2001a, title = {Universal Algorithms as an Alternative for Generating Non-Uniform Continuous Random Variates}, booktitle = {{M}onte {C}arlo {S}imulation}, year = {2001}, note = {Proceedings of the International Conference on {M}onte {C}arlo Simulation 2000}, pages = {177{\textendash}183}, publisher = {A. A. Balkema}, organization = {A. A. Balkema}, author = {Leydold, Josef and Wolfgang H{\"o}rmann} } @article {Hoermann:2000a, title = {Algorithm 802: An Automatic Generator for Bivariate Log-Concave Distributions}, journal = {ACMTOMS}, volume = {26}, number = {1}, year = {2000}, pages = {201{\textendash}219}, abstract = {

Different automatic (also called universal or black-box) methods have been suggested to sample from univariate log-concave distributions. Our new automatic algorithm for bivariate log-concave distributions is based on the method of transformed density rejection. In order to construct a hat function for a rejection algorithm the bivariate density is transformed by the logarithm into a concave function. Then it is possible to construct a dominating function by taking the minimum of several tangent planes, which are by exponentiation transformed back into the original scale. The choice of the points of contact is automated using adaptive rejection sampling. This means that points that are rejected by the rejection algorithm can be used as additional points of contact. The paper describes the details how this main idea can be used to construct Algorithm ALC2D that can generate random pairs from all bivariate log-concave distributions with known domain, computable density and computable partial derivatives.

}, url = {http://www.acm.org/pubs/citations/journals/toms/2000-26-1/p201-hormann/}, author = {Wolfgang H{\"o}rmann} } @conference {Hoermann;Leydold:2000a, title = {Automatic Random Variate Generation for Simulation Input}, booktitle = {Proceedings of the 2000 Winter Simulation Conference}, year = {2000}, pages = {675{\textendash}682}, author = {Wolfgang H{\"o}rmann and Leydold, Josef} } @conference {Leydold;Hoermann:2000a, title = {Black Box Algorithms for Generating Non-Uniform Continuous Random Variates}, booktitle = {COMPSTAT 2000. Short Communications and Posters}, year = {2000}, pages = {53{\textendash}54}, publisher = {Statistics Netherlands}, organization = {Statistics Netherlands}, author = {Leydold, Josef and Wolfgang H{\"o}rmann} } @conference {eksioglu2000effects, title = {Effects of grip span and shoulder posture on endurance limit of force}, booktitle = {IEA 2000/HFES 2000: 14thTriennial Congress}, year = {2000}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {14462270, title = {{Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches}}, journal = {Computers \& Operations Research}, volume = {27}, year = {2000}, pages = {461{\textendash}494}, doi = {10.1016/S0305-0548(99)00065-9}, author = {I. Kuban Altinel and Necati Aras and John Oommen} } @conference {Leydold;Leeb;Hoermann:2000a, title = {Higher Dimensional Properties of Non-Uniform Pseudo-Random Variates}, booktitle = {Monte Carlo and Quasi-Monte Carlo Methods 1998}, year = {2000}, pages = {341{\textendash}355}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, author = {Leydold, Josef and Leeb, Hannes and Wolfgang H{\"o}rmann} } @conference {507696, title = {{A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE}}, booktitle = {European Conference on Artificial Intelligence}, year = {2000}, pages = {261{\textendash}265}, author = {Necati Aras and I. Kuban Altinel and John Oommen} } @conference {aras2000kohonen, title = {A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE.}, booktitle = {ECAI}, year = {2000}, pages = {261{\textendash}265}, author = {Necati Aras and I. Kuban Altinel and Oommen, B John} } @conference {Hoermann;Bayar:2000a, title = {Modelling Probability Distributions from Data and its Influence on Simulation}, booktitle = {Proceedings IMACS Symposium on Mathematical Modeling}, year = {2000}, pages = {429-435}, author = {Wolfgang H{\"o}rmann and Bayar, Onur} } @conference {eksioglu1999search, title = {In search of relative optimum grip span}, booktitle = {CD-ROM Proceedings of CybErg 1999: The Second International Cyberspace Conference on Ergonomics}, year = {1999}, pages = {494{\textendash}504}, publisher = {The International Ergonomics Association Press}, organization = {The International Ergonomics Association Press}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {1740244, title = {{The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem}}, journal = {Neural Networks}, volume = {12}, year = {1999}, pages = {1273{\textendash}1284}, doi = {10.1016/S0893-6080(99)00063-5}, author = {Necati Aras and John Oommen and I. Kuban Altinel} } @article {14552649, title = {{Optimal planning and scheduling of batch plants with operational uncertainties: An industrial application to Baker{\textquoteright}s yeast production}}, journal = {Computers \& Chemical Engineering}, volume = {23}, year = {1999}, doi = {10.1016/S0098-1354(99)80045-3}, author = {Seza Or{\c c}un and T. Cebe and I. Kuban Altinel and {\"O}ner Horta{\c c}su} } @article {14552513, title = {{Reducing the integrality gap with a modified re-formulation linearization approach}}, journal = {Computers \& Chemical Engineering}, volume = {23}, year = {1999}, doi = {10.1016/S0098-1354(99)80133-1}, author = {Seza Or{\c c}un and I. Kuban Altinel and {\"O}ner Horta{\c c}su} } @inbook {oommen1999solving, title = {Solving the Travelling Salesman Problem using the Kohonen Network Incorporating Explicit Statistics}, booktitle = {Neural Nets WIRN VIETRI-98}, year = {1999}, pages = {273{\textendash}282}, publisher = {Springer London}, organization = {Springer London}, author = {Oommen, B John and Necati Aras and I. Kuban Altinel} } @conference {2482925, title = {{Using Paradigm Plus CASE Tool in a Fusion-Based Application Development Project}}, booktitle = {Technology of Object-Oriented Languages and Systems}, year = {1999}, pages = {424{\textendash}427}, doi = {10.1109/TOOLS.1999.796516}, author = {Nijaz Bajgoric and I. Kuban Altinel and Murat Draman and Ali Tamer {\"U}nal} } @article {1654599, title = {{Discrete vector quantization for arbitrary distance function estimation}}, journal = {IEEE Transactions on Systems, Man, and Cybernetics}, volume = {28}, year = {1998}, pages = {496{\textendash}510}, doi = {10.1109/3477.704289}, author = {John Oommen and I. Kuban Altinel and Necati Aras} } @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} } @article {14443912, title = {{Optimum component test plans for systems with dependent components}}, journal = {European Journal of Operational Research}, volume = {111}, year = {1998}, pages = {175{\textendash}186}, doi = {10.1016/S0377-2217(97)00355-X}, author = {I. Kuban Altinel and S{\"u}leyman {\"O}zekici} } @article {Leydold;Hoermann:1998a, title = {A Sweep-Plane Algorithm for Generating random tuples in simple polytopes}, journal = {Mathematics of Computation}, volume = {67}, number = {224}, year = {1998}, pages = {1617{\textendash}1635}, keywords = {black box, multivariate log-concave distributions, polytope, rejection method, sweep-plane algorithm, T-concave, TDR, uniform distributions, universal method}, author = {Leydold, Josef and Wolfgang H{\"o}rmann} } @article {bilge1997agv, title = {AGV systems with multi-load carriers: basic issues and potential benefits}, journal = {Journal of manufacturing systems}, volume = {16}, number = {3}, year = {1997}, pages = {159{\textendash}174}, publisher = {Elsevier}, author = {{\"U}mit Bilge and Tanchoco, JMA} } @conference {oommen1997arbitrary, title = {Arbitrary distance function estimation using discrete vector quantization}, booktitle = {Neural Networks, 1997., International Conference on}, volume = {2}, year = {1997}, pages = {1272{\textendash}1277}, publisher = {IEEE}, organization = {IEEE}, author = {Oommen, John and I. Kuban Altinel and Necati Aras} } @conference {Leydold;Hoermann:1997a, title = {The automatic generation of one- and multi-dimensional distributions with transformed density rejection}, booktitle = {Proceedings of the 15th IMACS World-Congress, Berlin, Vol 2}, year = {1997}, pages = {757{\textendash}760}, author = {Leydold, Josef and Wolfgang H{\"o}rmann} } @conference {Hoermann;Derflinger:1997a, title = {An automatic generator for a large class of unimodal discrete distributions}, booktitle = {ESM 97}, year = {1997}, pages = {139{\textendash}144}, author = {Wolfgang H{\"o}rmann and Derflinger, Gerhard} } @article {26063414, title = {{A dynamic model for component testing}}, journal = {Naval Research Logistics}, volume = {44}, year = {1997}, pages = {187{\textendash}197}, doi = {10.1002/(SICI)1520-6750(199703)44:2<187::AID-NAV3>3.0.CO;2-5}, author = {I. Kuban Altinel} } @article {ulusoy1997genetic, title = {A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles}, journal = {Computers \& Operations Research}, volume = {24}, number = {4}, year = {1997}, pages = {335{\textendash}351}, publisher = {Elsevier}, author = {Ulusoy, G{\"u}nd{\"u}z and Sivrikaya-{\c S}erifoǧlu, Funda and {\"U}mit Bilge} } @article {1486, title = {A model for long-term air quality prediciton and development of efficient control strategies in Turkey}, journal = {EUROPEAN JOURNAL OF OPERATIONAL RESEARCH}, volume = {102}, year = {1997}, month = {Oct}, pages = {380{\textendash}392}, issn = {0377-2217}, author = {G{\"u}rkan Kumbaro{\u g}lu} } @article {eksioglu1997predicting, title = {Predicting peak pinch strength: Artificial neural networks vs. regression}, journal = {Occupational Health and Industrial Medicine}, volume = {1}, number = {36}, year = {1997}, pages = {5}, author = {Mahmut Ek{\c s}io{\u g}lu and Fernandez, JE and Twomey, JM} } @article {1489, title = {Rescheduling on a single machine with part type dependent setup times and deadlines}, journal = {Annals of Operations Research}, volume = {70}, year = {1997}, month = {Jan}, pages = {93{\textendash}113}, issn = {02545330}, author = {Ali Tamer {\"U}nal and Uzsoy, Reha and Kiran, Ali} } @article {49169217, title = {{Scheduling of batch processes: An industrial application in paint industry}}, journal = {Computers \& Chemical Engineering}, volume = {21}, year = {1997}, doi = {10.1016/S0098-1354(97)87580-1}, author = {Seza Or{\c c}un and I. Kuban Altinel and {\"O}ner Horta{\c c}su} } @article {islam1997tabu, title = {A Tabu Search Approach for the Single Machine Mean Tardiness Problem}, journal = {Journal of the Operational Research Society}, volume = {48}, number = {7}, year = {1997}, pages = {751{\textendash}755}, publisher = {Operational Research Society}, author = {Islam, Anvarul and Mahmut Ek{\c s}io{\u g}lu} } @article {859143, title = {{Vector Quantization for Arbitrary Distance Function Estimation}}, journal = {Informs Journal on Computing}, volume = {9}, year = {1997}, pages = {439{\textendash}451}, doi = {10.1287/ijoc.9.4.439}, author = {I. Kuban Altinel and John Oommen and Necati Aras} } @conference {eksioglu1996artificial, title = {Artificial neural network-based prediction models for determiing maximum acceptable frequency of a drilling task}, booktitle = {Advances in Applied Ergonomics (1st International Conference on Applied Ergonomics)}, year = {1996}, pages = {646{\textendash}649}, publisher = {USA Publishing}, organization = {USA Publishing}, author = {Mahmut Ek{\c s}io{\u g}lu and Fernandez, Jeffrey E.} } @book {eksioglu1996determining, title = {Determining the optimum grip span and modeling work/rest cycles for intermittent gripping tasks}, year = {1996}, author = {Mahmut Ek{\c s}io{\u g}lu} } @conference {islam1996optimal, title = {Optimal maintenance inspection frequency: A multicriteria approach}, booktitle = {Proceedings of 5th Industrial Engineering Research Conference}, year = {1996}, pages = {639{\textendash}644}, publisher = {GA: Institute of Industrial Engineers}, organization = {GA: Institute of Industrial Engineers}, author = {Islam, Anvarul and Mahmut Ek{\c s}io{\u g}lu} } @article {14443126, title = {{Parametric distance functions vs. nonparametric neural networks for estimating road travel distances}}, journal = {European Journal of Operational Research}, volume = {93}, year = {1996}, pages = {230{\textendash}243}, doi = {10.1016/0377-2217(96)00045-8}, author = {Ethem Alpaydin and I. Kuban Altinel and Necati Aras} } @article {eksioglu1996predicting, title = {Predicting peak pinch strength: artificial neural networks vs. regression}, journal = {International Journal of Industrial Ergonomics}, volume = {18}, number = {5}, year = {1996}, pages = {431{\textendash}441}, publisher = {Elsevier}, author = {Mahmut Ek{\c s}io{\u g}lu and Fernandez, Jeffrey E and Twomey, Janet M} } @article {Hoermann;Derflinger:1996a, title = {Rejection-Inversion to Generate Variates from Monotone Discrete Distributions}, journal = {ACMTOMACS}, volume = {6}, number = {3}, year = {1996}, pages = {169{\textendash}184}, keywords = {monotone discrete distributions, Poisson distribution, random number generation, rejection-inversion, T-concave, universal algorithm, Zipf distribution}, author = {Wolfgang H{\"o}rmann and Derflinger, Gerhard} } @article {14551568, title = {{Scheduling of batch processes with operational uncertainties}}, journal = {Computers \& Chemical Engineering}, volume = {20}, year = {1996}, doi = {10.1016/0098-1354(96)00206-2}, author = {Seza Or{\c c}un and I. Kuban Altinel and {\"O}ner Horta{\c c}su} } @conference {50018430, title = {{Arbitrary distance function estimation using vector quantization}}, booktitle = {International Symposium on Neural Networks}, year = {1995}, doi = {10.1109/ICNN.1995.487272}, author = {John Oommen and I. Kuban Altinel and Necati Aras} } @conference {ekcsiouglu1995artificial, title = {An artificial neural network (ANN)}, booktitle = {Advances in Industrial Ergonomics and Safety VII (Proceedings of the Tenth Annual International Industrial Ergonomics and Safety Conference)}, year = {1995}, pages = {577{\textendash}584}, publisher = {Taylor \& Francis}, organization = {Taylor \& Francis}, author = {Mahmut Ek{\c s}io{\u g}lu and Fernandez, Jeffrey E and Twomey, Janet M} } @article {Hoermann:1995a, title = {A Rejection Technique for Sampling from {T}-Concave Distributions}, journal = {ACMTOMS}, volume = {21}, number = {2}, year = {1995}, pages = {182{\textendash}193}, keywords = {black box, log-concave, nonuniform RNG, rejection algorithm, rejection method, T-concave, t-distribution, transformed density rejection, unimodal distributions}, author = {Wolfgang H{\"o}rmann} } @article {bilge1995time, title = {A time window approach to simultaneous scheduling of machines and material handling system in an FMS}, journal = {Operations Research}, volume = {43}, number = {6}, year = {1995}, pages = {1058{\textendash}1070}, publisher = {INFORMS}, author = {{\"U}mit Bilge and Ulusoy, G{\"u}nd{\"u}z} } @article {14442391, title = {{The design of optimum component test plans in the demonstration of system reliability}}, journal = {European Journal of Operational Research}, volume = {78}, year = {1994}, pages = {318{\textendash}333}, doi = {10.1016/0377-2217(94)90043-4}, author = {I. Kuban Altinel} } @conference {Hauser;Hoermann;Kunst;Lenneis:1994a, title = {A note on generation, estimation and prediction of stationary processes}, booktitle = {Compstat, Proceedings in Computational Statistics}, year = {1994}, pages = {323{\textendash}328}, publisher = {Physica-Verlag}, organization = {Physica-Verlag}, address = {Heidelberg}, author = {Hauser, M.A. and Wolfgang H{\"o}rmann and Kunst, R.M. and Lenneis, J.} } @article {Hoermann:1994a, title = {A Note on the Quality of Random Variates Generated by the Ratio of Uniforms Method}, volume = {4}, number = {1}, year = {1994}, pages = {96{\textendash}106}, keywords = {linear congruential generators, lower bounds, one-dimensional distribution of pseudorandom numbers, ratio of uniforms method, uniform random numbers}, author = {Wolfgang H{\"o}rmann} } @conference {Hoermann:1994c, title = {The quality of non-uniform random numbers}, booktitle = {Operations Research Proceedings 1993}, year = {1994}, pages = {329{\textendash}335}, publisher = {Springer Verlag}, organization = {Springer Verlag}, address = {Berlin}, author = {Wolfgang H{\"o}rmann} } @article {Hoermann;Derflinger:1994a, title = {The transformed rejection method for generating random variables, an alternative to the ratio of uniforms method}, journal = {Commun. Stat., Simulation Comput.}, volume = {23}, number = {3}, year = {1994}, pages = {847-860}, keywords = {normal distribution, random variate generation, t-distribution, transformed rejection method}, author = {Wolfgang H{\"o}rmann and Derflinger, Gerhard} } @article {Hoermann:1994b, title = {A universal generator for discrete log-concave distributions}, journal = {Computing}, volume = {52}, number = {1}, year = {1994}, pages = {89{\textendash}96}, keywords = {log-concave distribution, random number generation, rejection method, simulation}, author = {Wolfgang H{\"o}rmann} } @conference {Hoermann;Derflinger:1994b, title = {Universal generators for correlation induction}, booktitle = {Compstat, Proceedings in Computational Statistics}, year = {1994}, pages = {52{\textendash}57}, publisher = {Physica-Verlag}, organization = {Physica-Verlag}, address = {Heidelberg}, author = {Wolfgang H{\"o}rmann and Derflinger, Gerhard} } @article {Hoermann:1993a, title = {The generation of binomial random variates}, journal = {J. Stat. Comput. Simulation}, volume = {46}, number = {1{\textendash}2}, year = {1993}, pages = {101{\textendash}110}, keywords = {binomial distribution, binomial random variates, fast rejection algorithm, random numbers, transformed rejection method}, author = {Wolfgang H{\"o}rmann} } @inbook {Hoermann1993, title = {New generators of normal and {P}oisson deviates based on transformed rejection}, booktitle = {Operations Research Proceedings 1992}, year = {1993}, note = {Proc. DGOR-Tagung Aachen Sept. 92}, pages = {334{\textendash}341}, publisher = {Springer}, organization = {Springer}, address = {Berlin}, author = {Wolfgang H{\"o}rmann} } @article {Hoermann;Derflinger:1993a, title = {A Portable Random Number Generator Well Suited for the Rejection Method}, volume = {19}, number = {4}, year = {1993}, pages = {489{\textendash}495}, abstract = {

Up to now, all known efficient portable implementations of linear congruential random number generators with modulus $2^{31} - 1$ have worked only with multipliers that are small compared with the modulus. We show that for nonuniform distributions, the rejection method may generate random numbers of bad qualify if combined with a linear congruential generator with small multiplier. A method is described that works for any multiplier smaller than $2^{30}$. It uses the decomposition of multiplier and seed in high-order and low-order bits to compute the upper and lower half of the product. The sum of the two halves gives the product of multiplier and seed modulo $2^{21} - 1$. Coded in ANSI-C and FORTRAN77 the method results in a portable implementation of the linear congruential generator that is as fast or faster than other portable methods.

}, keywords = {algorithms, linear congruential generator, portability, quality of nonuniform random numbers, rejection method, uniform random number generator}, author = {Wolfgang H{\"o}rmann and Derflinger, Gerhard} } @article {1490, title = {A probabilistic cost-based due date assignment model for job shops}, journal = {International Journal of Production Research}, volume = {31}, year = {1993}, pages = {2817-2834}, abstract = {

Abstract In this paper, a cost-based due date assignment methodology is proposed. The method uses two pre-specified parameters: an estimate of the job flow time and the probability of the job being tardy. An optimization model is presented to find the best tardiness probability of the job based on a total cost function involving the work-in-process inventory and the tardiness costs. Using the results of the correlation analysis performed on a wide set of shop, job and job{\textquoteright}s route related variables, ten models are constructed to estimate the flow time of a job in the shop. The models are then compared based on the simplicity of the model and the standard deviation of the estimate errors. One of the models is recommended and tested to check if it can be used in different shop scenarios. As a result, it is observed that the model performs satisfactorily in all the shop conditions considered in this study.

}, doi = {10.1080/00207549308956902}, url = {https://doi.org/10.1080/00207549308956902}, author = {A. C. KAPLAN and Ali Tamer {\"U}nal} } @article {ulusoy1993simultaneous, title = {Simultaneous scheduling of machines and automated guided vehicles}, journal = {THE INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH}, volume = {31}, number = {12}, year = {1993}, pages = {2857{\textendash}2873}, publisher = {Taylor \& Francis}, author = {Ulusoy, G and {\"U}mit Bilge} } @article {Hoermann:1993b, title = {The transformed rejection method for generating {P}oisson random variables}, journal = {Insurance: Mathematics and Economics}, volume = {11}, year = {1993}, pages = {1{\textendash}7}, author = {Wolfgang H{\"o}rmann} } @article {1492, title = {BATCH SEQUENCING}, journal = {IIE Transactions}, volume = {24}, year = {1992}, pages = {73-83}, abstract = {

Consider the single machine scheduling problem where there are a number of part types to be processed. A part type is defined as follows: Two parts are of the same part type if the machine does not require a setup in between the processing of these parts. The problem investigated in this paper is to find a sequence of batches of parts (if there are any) where all the requirements for parts are met. A heuristic and an exact algorithm are developed, and computational analysis is performed to measure the performance of the heuristic. The time complexity function of the heuristic is O(n2), and the exact algorithm runs in polynomial time given a fixed upper bound on the number of setups.

}, doi = {10.1080/07408179208964235}, url = {https://doi.org/10.1080/07408179208964235}, author = {Ali Tamer {\"U}nal and Ali S. Kiran} } @article {1491, title = {A location problem on unicyclic networks: Balanced case}, journal = {European Journal of Operational Research}, volume = {62}, year = {1992}, pages = {194-202}, abstract = {

The problem of locating n stations on a unicyclic unidirectional network is considered. We formulated the problem as an integer program for the case of a balanced flow matrix, i.e., the total inflow to a station equals the total outflow from that station. The integer programming formulation reduces the problem to a station sequencing problem regardless of the actual station locations on the network. Furthermore, the empirical evidence suggests that the LP solutions to the relaxed IP formulations are optimal.

}, issn = {0377-2217}, doi = {https://doi.org/10.1016/0377-2217(92)90247-7}, url = {https://www.sciencedirect.com/science/article/pii/0377221792902477}, author = {Ali S. Kiran and Ali Tamer {\"U}nal and Selcuk Karabati} } @book {eksioglu1992model, title = {A Model for Impairment Evaluation of Wrist Due to the Loss of Wrist Range of Motion}, year = {1992}, publisher = {Wichita State University, Department of Industrial Engineering}, organization = {Wichita State University, Department of Industrial Engineering}, author = {Mahmut Ek{\c s}io{\u g}lu} } @conference {Afflerbach;Hoermann:1992a, title = {Nonuniform random numbers: A sensitivity analysis for transformation methods}, booktitle = {Lecture Notes in Econom. Math. Systems}, series = {Lect. Notes Econ. Math. Syst.}, volume = {374}, year = {1992}, note = {Proc. Int. Workshop Comput. Intensive Methods Simulation Optimization, Laxenburg/Austria 1990}, pages = {135{\textendash}144}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {New York}, abstract = {

-?-

}, keywords = {-?-}, author = {Afflerbach, Lothar and Wolfgang H{\"o}rmann} } @article {Hoermann;Derflinger:1990a, title = {The ACR method for generating normal random variables}, journal = {OR Spektrum}, volume = {12}, number = {3}, year = {1990}, pages = {181{\textendash}185}, keywords = {acceptance-complement method, ACR method, decomposition method, normal random number generator, ratio of uniform method}, author = {Wolfgang H{\"o}rmann and Derflinger, Gerhard} }