20 sonucu aktar:
[ Yazar(Asc)] Başlık Tür Yıl
Süzgeçler: First Letter Of Last Name: D  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
D
Durmaz, E., N. Aras, and K. I. Altinel, "Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations", Computers & Operations Research, vol. 36, pp. 2139–2148, 2009.
Draman, M., K. I. Altinel, N. Bajgoric, A. Tamer Ünal, and B. Birgören, "A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries", European Journal of Operational Research, vol. 137, pp. 483–496, 2002.
Döyen, A., N. Aras, and G. Barbarosoğlu, "A two-echelon stochastic facility location model for humanitarian relief logistics", Optimization Letters, vol. 6, no. 6: Springer-Verlag, pp. 1123–1145, 2012.
Dingeç, K. Dinçer, and W. Hörmann, "Control variates and conditional Monte Carlo for basket and Asian options", Insurance: Mathematics and Economics, vol. 52, no. 3: North-Holland, pp. 421–434, 2013.
Dingeç, K. Dinçer, and W. Hörmann, "Using the continuous price as control variate for discretely monitored options", Mathematics and Computers in Simulation, vol. 82, no. 4: North-Holland, pp. 691–704, 2011.
Dingeç, K. Dinçer, and W. Hörmann, "New control variates for Lévy process models", Proceedings of the Winter Simulation Conference: Winter Simulation Conference, pp. 15, 2012.
Dingeç, K. Dinçer, and W. Hörmann, "A general control variate method for option pricing under Lévy processes", European Journal of Operational Research, vol. 221, no. 2: North-Holland, pp. 368–377, 2012.
Derflinger, G., W. Hörmann, J. Leydold, and H. Sak, "Efficient Numerical Inversion for Financial Simulations", Monte Carlo and Quasi-Monte Carlo Methods 2008, Heidelberg, Springer-Verlag, pp. 297–304, 2009.
Derflinger, G., and W. Hörmann, "Asymptotically Optimal Design Points for Rejection Algorithms", Communications in Statistics: Simulation and Computation, vol. 34, no. 4, pp. 879-893, 2005.
Deng, H., M. Gokce Baydogan, and G. Runger, "SMT: Sparse multivariate tree", Statistical Analysis and Data Mining, vol. 7, issue 1, pp. 53-69, 02/2014.
Demange, M., and T. Ekim, "Minimum maximal matching is NP-hard in regular bipartite graphs", Theory and Applications of Models of Computation: Springer, pp. 364–374, 2008.
Demange, M., T. Ekim, B. Ries, and C. Tanasescu, "On some applications of the selective graph coloring problem", European Journal of Operational Research: North-Holland, 2014.
Demange, M., T. Ekim, and D. de Werra, "(p, k)-coloring problems in line graphs", Theoretical computer science, vol. 349, no. 3: Elsevier, pp. 462–474, 2005.
Demange, M., T. Ekim, and C. Tanasescu, "Hardness and approximation of minimum maximal matchings", International Journal of Computer Mathematics, no. ahead-of-print: Taylor & Francis, pp. 1–20, 2013.
Demange, M., T. Ekim, D. de Werra, and , "On the approximation of Min Split-coloring and Min Cocoloring.", J. Graph Algorithms Appl., vol. 10, no. 2, pp. 297–315, 2006.
Demange, M., T. Ekim, and , "A note on the NP-hardness of two matching problems in induced subgrids", Discrete Mathematics and Theoretical Computer Science, vol. 15, no. 2, pp. 233–242, 2013.
Demange, M., T. Ekim, and D. de Werra, "A tutorial on the use of graph coloring for some problems in robotics", European Journal of Operational Research, vol. 192, no. 1: North-Holland, pp. 41–55, 2009.
Demange, M., and T. Ekim, "Efficient recognition of equimatchable graphs", Information Processing Letters, vol. 114, no. 1: Elsevier, pp. 66–71, 2014.
Demange, M., T. Ekim, and D. de Werra, "Partitioning cographs into cliques and stable sets", Discrete Optimization, vol. 2, no. 2: Elsevier, pp. 145–153, 2005.
de Werra, D., T. Ekim, and C. Raess, "Construction of sports schedules with multiple venues", Discrete Applied Mathematics, vol. 154, no. 1: North-Holland, pp. 47–58, 2006.