432 sonucu aktar:
[ Yazar(Asc)] Başlık Tür Yıl
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
Duan, H., L. Zhu, G. Kumbaroğlu, Y. Fan, and , "Regional opportunities for China to go low-carbon: results from the REEC model", The Energy Journal, vol. 37, 2016.
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.
Döyen, A., and N. Aras, "An integrated disaster preparedness model for retrofitting and relief item transportation", Networks and Spatial Economics, vol. 19, pp. 1031–1068, 2019.
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 A. Korugan, "A stochastic analysis of asynchronous demand in disassembly processes of remanufacturing systems", European Journal of Industrial Engineering, vol. 7, pp. 175–205, 2013.
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.
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.
Dibek, C., T. Ekim, and P. Heggernes, "Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded", Discrete Mathematics, vol. 340, pp. 927 - 934, 2017.
Dibek, C., T. Ekim, D. Gözüpek, and M. Shalom, "Equimatchable graphs are C2k+ 1-free for k≥ 4", Discrete Mathematics, vol. 339, pp. 2964–2969, 2016.
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.
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.
Deniz, Z., and T. Ekim, "Edge-stable equimatchable graphs", Discrete Applied Mathematics, vol. 261, pp. 136-147, 2019.
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.
Demiröz, B. Evrim, K. I. Altinel, and L. Akarun, "Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms", European Journal of Operational Research, vol. 277, pp. 62-83, 2019.
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, "(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, B. Ries, and C. Tanasescu, "On some applications of the selective graph coloring problem", European Journal of Operational Research, vol. 240, pp. 307-314, 2015.
Demange, M., T. Ekim, and B. Ries, "On the minimum and maximum selective graph coloring problems in some graph classes", Discrete Applied Mathematics, vol. 204, pp. 77–89, 2016.
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, and D. de Werra, "Partitioning cographs into cliques and stable sets", Discrete Optimization, vol. 2, no. 2: Elsevier, pp. 145–153, 2005.
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., 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.
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.

Pages