Export 35 results:
Author Title Type [ Year(Desc)]
Filters: First Letter Of Last Name is T and Author is Z C Taşkın  [Clear All Filters]
2007
Men, C., E. H. Romeijn, Z. C. Taşkın, and J. F. Dempsey, "An Exact Approach to Direct Aperture Optimization in IMRT Treatment Planning", Physics in Medicine and Biology, vol. 52, no. 24, pp. 7333-7352, 2007.
2009
Taşkın, Z. C., C. J. Smith, S. Ahmed, and A. J. Schaefer, "Cutting Plane Algorithms for Solving a Stochastic Edge-Partition Problem", Discrete Optimization, vol. 6, no. 4, pp. 420-435, 2009.
Taşkın, Z. C., and A. Tamer Ünal, "Tactical Level Planning in Float Glass Manufacturing with Co-Production, Random Yields and Substitutable Products", European Journal of Operational Research, vol. 199, no. 1, pp. 252-261, 2009.
2010
Taşkın, Z. C., C. J. Smith, E. H. Romeijn, and J. F. Dempsey, "Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning", Operations Research, vol. 58, no. 3, pp. 674–690, 2010.
2012
Ağralı, S., J. Geunes, and Z. C. Taşkın, "A Facility Location Model with Safety Stock Costs: Analysis of the Cost of Single-Sourcing Requirements", Journal of Global Optimization, vol. 54(3), pp. 551-581, 2012.
Taşkın, Z. C., and T. Ekim, "Integer Programming Formulations for the Minimum Weighted Maximal Matching Problem", Optimization Letters, vol. 6(6), pp. 1161-1171, 2012.
Taşkın, Z. C., C. J. Smith, and E. H. Romeijn, "Mixed-Integer Programming Techniques for Decomposing IMRT Fluence Maps Using Rectangular Apertures", Annals of Operations Research, vol. 196(1), pp. 799-818, 2012.
2013
Taşkın, Z. C., and M. Cevik, "Combinatorial Benders Cuts for Decomposing IMRT Fluence Maps Using Rectangular Apertures", Computers and Operations Research, vol. 40(9), pp. 2178–2186, 2013.
Bodur, M., T. Ekim, and Z. C. Taşkın, "Decomposition Algorithms for Solving the Minimum Weight Maximal Matching Problem", Networks, vol. 62, no. 4, pp. 273–287, 2013.
2014
Sarıduman, A., A. Emre Pusane, and Z. C. Taşkın, "An Integer Programming-Based Search Technique for Error-Prone Substructures of LDPC Codes", AEU - International Journal of Electronics and Communications, vol. 68, issue 11, pp. 1097-1105, 2014.
Türkogullari, Y. Bogaç, Z. C. Taşkın, N. Aras, and K. I. Altinel, "Optimal berth allocation and time-invariant quay crane assignment in container terminals", European Journal of Operational Research, vol. 235, no. 1, pp. 88–101, 2014.
Aras, N., Y. Türkoğulları, Z. C. Taşkın, and K. I. Altinel, "Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals", Operations Research Proceedings 2012: Springer International Publishing, pp. 101–107, 2014.
2015
Gören, M., and Z. C. Taşkın, "A column generation approach for evaluating delivery efficiencies of collimator technologies in IMRT treatment planning", Physics in Medicine and Biology, vol. 60, issue 5, pp. 1989-2004, 2015.
Taşkın, Z. C., S. Ağralı, A. Tamer Ünal, V. Belada, and F. Gökten-Yılmaz, "Mathematical Programming-Based Sales and Operations Planning at Vestel Electronics", Interfaces, vol. 45, issue 4, pp. 325-340, 2015.
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.
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.
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.
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.
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.
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.
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.
Ü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.
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.

Pages