35 sonucu aktar:
Yazar [ Başlık(Desc)] Tür Yıl
Süzgeçler: Yazar: Z C Taşkın  [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 
B
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.
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.
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.
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.
C
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.
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.
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.
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.
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.
D
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.
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.
Ş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.
E
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.
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.
Ş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.
F
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.
I
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.
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.
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.
L
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.
M
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.
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.
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.
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.
O
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.
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.
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.
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.
P
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.

Pages