Z. Caner Taşkın

Bölüm Başkanı
Email: 
caner.taskin@bogazici.edu.tr
Tel. No.: 
7074
 
Lisans, EM, Boğaziçi Üniversitesi, 2003;
Y. Lisans, EM, Boğaziçi Üniversitesi, 2005;
Doktora, ESM, University of Florida, 2009.
 
Web: 
https://zctaskin.github.io/

Dersler

Yayınlar

  1. Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT), Dursun, Pınar, Taşkın Z C., and I. Altinel Kuban , Computers & Operations Research, Volume 110, p.1-17, (2019)
  2. Optimization–based decoding algorithms for LDPC convolutional codes in communication systems, Kabakulak, Banu, Taşkın Z C., and Pusane Ali Emre , IISE Transactions, Volume 51, p.1061-1074, (2019)
  3. A decomposition approach to solve the selective graph coloring problem in some perfect graph families, Şeker, Oylum, Ekim Tinaz, and Taşkın Z C. , Networks, Volume 73, p.145-169, (2019)
  4. The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT), Dursun, Pınar, Taşkın Z C., and I. Altinel Kuban , European Journal of Operational Research, Volume 272, p.372-388, (2019)
  5. A column generation heuristic for VMAT planning with adaptive CVaR constraints, Dursun, Pınar, Taşkın Z C., I. Altinel Kuban, Bilge Hatice, Kesen Nazmiye Dönmez, Okutan Murat, and Oral Ethem Nezih , Physics in Medicine {&} Biology, oct, Volume 64, p.205024, (2019)
  6. Minimum cost noncrossing flow problem on layered networks, I. Altinel, Kuban, Aras Necati, Şuvak Zeynep, and Taşkın Z C. , Discrete Applied Mathematics, Volume 261, p.2-21, (2019)
  7. Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem, Ahat, Betül, Ekim Tinaz, and Taşkın Z C. , INFORMS Journal on Computing, Volume 30, p.43-56, (2018)
  8. A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand, Güngör, Murat, Ünal Ali Tamer, and Taşkın Z C. , International Journal of Production Research, Volume 56, p.3344-3357, (2018)
  9. Employee Scheduling in Service Industries with Flexible Employee Availability and Demand, Ağralı, Semra, Taşkın Z C., and Ünal Ali Tamer , Omega, Volume 66, Issue A, p.159-169, (2017)
  10. Branch-cut-price algorithms for solving a class of search problems on general graphs, Taşkın, Z C., and J. Smith Cole , Networks, Volume 70, p.4-18, (2017)