@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 {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 {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 {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 {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 {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 {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 {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 {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 {._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 {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 {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} } @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 {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 {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 {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} } @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 {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 {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 {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} } @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 {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} } @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} }