@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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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} } @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} } @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 {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 {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 {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 {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 {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 {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 {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 {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 {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 {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} } @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 {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} } @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 {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 {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 {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} } @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} } @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 {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 {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} } @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} } @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 {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 {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 {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} } @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 {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 {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} } @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 {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 {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 {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 {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 {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} } @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 {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 {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} } @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;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 {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} }