50 sonucu aktar:
Yazar Başlık Tür [ Yıl(Desc)]
Süzgeçler: First Letter Of Last Name: S  [Clear All Filters]
2017
Boyacı, A., T. Ekim, and M. Shalom, "A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs", Information Processing Letters, vol. 121, pp. 29-33, 2017.
2018
Başoğlu, İ., W. Hörmann, and H. Sak, "Efficient simulations for a Bernoulli mixture model of portfolio credit risk", Annals of Operations Research, vol. 260, pp. 113–128, 2018.
Akbari, S., H. Alizadeh, T. Ekim, D. Gözüpek, and M. Shalom, "Equimatchable claw-free graphs", Discrete Mathematics, vol. 341, pp. 2859-2871, 2018.
Boyacı, A., T. Ekim, M. Shalom, and S. Zaks, "Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II", Discrete Mathematics and Theoretical Computer Science, vol. 20, pp. 1b–1b, 2018.
Ekim, T., A. Boyacı, and M. Shalom, "The maximum cardinality cut problem in co-bipartite chain graphs", Journal of Combinatorial Optimization, vol. 35, pp. 250–265, Jan, 2018.
Küçük, M., G. Kumbaroğlu, and KEMAL. SARICA, "Substitution elasticities in an energy-augmented CES production function An empirical analysis for Turkey", Journal of Economics and Political Economy, vol. 5, pp. 234–249, Jun, 2018.
2019
Öncan, T., Z. Şuvak, H. M. Akyüz, and K. I. Altinel, "Assignment problem with conflicts", Computers & Operations Research, vol. 111, pp. 214-229, 2019.
Şeker, O., T. Ekim, and Z. C. Taşkın, "A decomposition approach to solve the selective graph coloring problem in some perfect graph families", Networks, vol. 73, pp. 145-169, 2019.
I. Altinel, K., N. Aras, Z. Şuvak, and Z. C. Taşkın, "Minimum cost noncrossing flow problem on layered networks", Discrete Applied Mathematics, vol. 261, pp. 2-21, 2019.
Sertdemir, S., A. Tamer Ünal, and ZEHRA. DÜZGİT, "Periodic Due Date Assignment with Family Setups", INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, vol. 26, pp. 0–0, 2019.
Ekim, T., J. Gimbel, and O. Şeker, "Small 1-defective Ramsey numbers in perfect graphs", Discrete Optimization, vol. 34, pp. 100548, 2019.
2020
Sarıduman, A., A. E. Pusane, and Z. C. Taşkın, "On the Construction of Regular QC-LDPC Codes With Low Error Floor", IEEE Communications Letters, vol. 24, pp. 25-28, 2020.
Şuvak, Z., K. I. Altinel, and N. Aras, "Exact solution algorithms for the maximum flow problem with additional conflict constraints", European Journal of Operational Research, vol. 287, pp. 410-437, 2020.
Sahin, Ö., F. Şentürk, Y. Barlas, and H. Yasarcan, "Modeling the pharmacodynamics of nandrolone doping drug and implications for anti-doping testing", System Dynamics Review, vol. 36, pp. 467-496, 2020.
Sahin, Ö., F. Şentürk, Y. Barlas, and H. Yasarcan, "Modeling the pharmacodynamics of nandrolone doping drug and implications for anti-doping testing", System Dynamics Review, vol. 36, pp. 467-496, 2020.
Kumbaroğlu, G., C. Canaz, J. Deason, and E. Shittu, "Profitable Decarbonization through E-Mobility", Energies, vol. 13, 2020.
Sadati, M. Ehsan Hesa, D. Aksen, and N. Aras, "The r-interdiction selective multi-depot vehicle routing problem", International Transactions in Operational Research, vol. 27, pp. 835-866, 2020.
Sadati, M. Ehsan Hesa, D. Aksen, and N. Aras, "A trilevel r-interdiction selective multi-depot vehicle routing problem with depot protection", Computers & operations research, vol. 123, pp. 104996, 2020.
2021
Şeker, O., T. Ekim, and Z. C. Taşkın, "An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs", European Journal of Operational Research, vol. 291(1), pp. 67–83, 2021.
Sivrikaya, Ö. Emre, M. Yükselgönül, and M. Gokce Baydogan, "Learning prototypes for multiple instance learning.", Turkish Journal of Electrical Engineering & Computer Sciences, vol. 29, 2021.

Pages