Export 67 results:
Author Title Type [ Year(Asc)]
Filters: First Letter Of Last Name is T  [Clear All Filters]
2022
Küçükaşcı, E. Şeyma, M. Gokce Baydogan, and Z. C. Taşkın, "Multiple instance classification via quadratic programming", Journal of Global Optimization, pp. 1–32, 2022.
2021
Kalay, S., and Z. C. Taşkın, "A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production", Computers & Operations Research, vol. 135, pp. 105430, 2021.
Kabakulak, B., Z. C. Taşkın, and A. Emre Pusane, "A Branch-Price-and-Cut Algorithm for Optimal Decoding of LDPC Codes", Journal of Global Optimization, vol. 81, pp. 805–834, 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.
Küçükaşcı, E. Şeyma, M. Gokce Baydogan, and Z. C. Taşkın, "A linear programming approach to multiple instance learning", Turkish Journal of Electrical Engineering & Computer Sciences, vol. 29, pp. 2186–2201, 2021.
Kalay, S., and Z. C. Taşkın, "Single Machine Campaign Planning under Sequence Dependent Family Setups and Co-Production", Journal of the Operational Research Society, vol. 72, pp. 2091–2111, 2021.
2020
Kabakulak, B., Z. C. Taşkın, and A. E. Pusane, "A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems", Networks, vol. 75, pp. 137-157, 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.
M. Aydin, A., and Z. C. Taşkın, "Decentralized decomposition algorithms for peer-to-peer linear optimization", RAIRO-Oper. Res., vol. 54, pp. 1835-1861, 2020.
Tanınmış, K., N. Aras, K. I. Altinel, and E. Güney, "Minimizing the misinformation spread in social networks", IISE Transactions, vol. 52, pp. 850-863, 2020.
Ünal, A. Tamer, S. Ağralı, and Z. C. Taşkın, "A strong integer programming formulation for hybrid flowshop scheduling", Journal of the Operational Research Society, vol. 71, pp. 2042-2052, 2020.
2019
Dursun, P., Z. C. Taşkın, K. I. Altinel, H. Bilge, N. Dönmez Kesen, M. Okutan, and E. Nezih Oral, "A column generation heuristic for VMAT planning with adaptive CVaR constraints", Physics in Medicine {&} Biology, vol. 64, pp. 205024, oct, 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.
Dursun, P., Z. C. Taşkın, and K. I. Altinel, "The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT)", European Journal of Operational Research, vol. 272, pp. 372-388, 2019.
Tanınmış, K., N. Aras, and K. I. Altinel, "Influence maximization with deactivation in social networks", European Journal of Operational Research, vol. 278, pp. 105-119, 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.
Kabakulak, B., Z. C. Taşkın, and A. Emre Pusane, "Optimization–based decoding algorithms for LDPC convolutional codes in communication systems", IISE Transactions, vol. 51, pp. 1061-1074, 2019.
Dursun, P., Z. C. Taşkın, and K. I. Altinel, "Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT)", Computers & Operations Research, vol. 110, pp. 1-17, 2019.
2018
Tuncel, K. Sinan, and M. Gokce Baydogan, "Autoregressive forests for multivariate time series modeling", Pattern Recognition, vol. 73, pp. 202 - 215, 2018.
Ahat, B., T. Ekim, and Z. C. Taşkın, "Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem", INFORMS Journal on Computing, vol. 30, pp. 43-56, 2018.
Güngör, M., A. Tamer Ünal, and Z. C. Taşkın, "A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand", International Journal of Production Research, vol. 56, pp. 3344-3357, 2018.
2017
Taşkın, Z. C., and C. J. Smith, "Branch-cut-price algorithms for solving a class of search problems on general graphs", Networks, vol. 70, pp. 4-18, 2017.
Tombuş, A. Cilacı, N. Aras, and V. Verter, "Designing distribution systems with reverse flows", Journal of Remanufacturing, vol. 7, pp. 113–137, 2017.
Ağralı, S., Z. C. Taşkın, and A. Tamer Ünal, "Employee Scheduling in Service Industries with Flexible Employee Availability and Demand", Omega, vol. 66, issue A, pp. 159-169, 2017.
Şeker, O., P. Heggernes, T. Ekim, and C. Z. Taşkın, "Linear-Time Generation of Random Chordal Graphs", International Conference on Algorithms and Complexity: Springer, 2017.
2016
Aktaş, G., N. Tellioğlu, Y. Barlas, and H. Yaşarcan, "Modeling the Long Term Dynamics of Obesity as a Societal Epidemic", 34th International Conference of the System Dynamics Society, Delft, the Netherlands, 2016.
Türkoğulları, Y. B., C. Z. Taşkın, N. Aras, and K. I. Altinel, "Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals", European Journal of Operational Research, vol. 254, pp. 985–1001, 2016.
Türkoğulları, Y. B., C. Z. Taşkın, N. Aras, and K. I. Altinel, "Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals", European Journal of Operational Research, vol. 254, pp. 985–1001, 2016.
Türkogullari, Y. Bogaç, Z. C. Taşkın, N. Aras, and K. I. Altinel, "Optimal Berth Allocation, Time-variant Quay Crane Assignment and Scheduling with Crane Setups in Container Terminals", European Journal of Operational Research, vol. 254, issue 3, pp. 985-1001, 2016.
Türkogullari, Y. Bogaç, Z. C. Taşkın, N. Aras, and K. I. Altinel, "Optimal Berth Allocation, Time-variant Quay Crane Assignment and Scheduling with Crane Setups in Container Terminals", European Journal of Operational Research, vol. 254, issue 3, pp. 985-1001, 2016.

Pages