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. Multiple instance classification via quadratic programming, Küçükaşcı, Emel Şeyma, Baydogan Mustafa Gokce, and Taşkın Z C. , Journal of Global Optimization, p.1–32, (2022)
  2. A Branch-Price-and-Cut Algorithm for Optimal Decoding of LDPC Codes, Kabakulak, Banu, Taşkın Z C., and Pusane Ali Emre , Journal of Global Optimization, Volume 81, p.805–834, (2021)
  3. A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production, Kalay, Serkan, and Taşkın Z C. , Computers & Operations Research, Volume 135, p.105430, (2021)
  4. A linear programming approach to multiple instance learning, Küçükaşcı, Emel Şeyma, Baydogan Mustafa Gokce, and Taşkın Z C. , Turkish Journal of Electrical Engineering & Computer Sciences, Volume 29, p.2186–2201, (2021)
  5. Single Machine Campaign Planning under Sequence Dependent Family Setups and Co-Production, Kalay, Serkan, and Taşkın Z C. , Journal of the Operational Research Society, Volume 72, p.2091–2111, (2021)
  6. An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs, Şeker, Oylum, Ekim Tinaz, and Taşkın Z C. , European Journal of Operational Research, Volume 291(1), p.67–83, (2021)
  7. A strong integer programming formulation for hybrid flowshop scheduling, Ünal, Ali Tamer, Ağralı Semra, and Taşkın Z C. , Journal of the Operational Research Society, Volume 71, p.2042-2052, (2020)
  8. On the Construction of Regular QC-LDPC Codes With Low Error Floor, Sarıduman, Abdullah, Pusane Ali E., and Taşkın Z C. , IEEE Communications Letters, Volume 24, p.25-28, (2020)
  9. Decentralized decomposition algorithms for peer-to-peer linear optimization, M. Aydin, Asli, and Taşkın Z C. , RAIRO-Oper. Res., Volume 54, p.1835-1861, (2020)
  10. A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems, Kabakulak, Banu, Taşkın Z C., and Pusane Ali E. , Networks, Volume 75, p.137-157, (2020)