Z. Caner Taşkın

B.S. in IE, Boğaziçi University, 2003;
M.S. in IE, Boğaziçi University, 2005;
Ph.D. in ISE, University of Florida, 2009.
Research Interests: 
Mixed-integer programming, Constraint programming, Decomposition algorithms for large-scale optimization, Applications of operations research in healthcare and telecommunications

Recent publications

  1. 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)
  2. 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)
  3. 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)
  4. 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)
  5. 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)