Z. Caner Taskin

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 32

Top Topics

Integer Program

Integer Programming Formulation

Top Venues

Eur. J. Oper. Res.

RAIRO Oper. Res.

Publications

Wilco van den Heuvel, Semra Agrali, Z. Caner Taskin
A Decomposition Algorithm for Single and Multiobjective Integrated Market Selection and Production Planning. INFORMS J. Comput. 35 (6) (2023)
Ali Erdem Banak, Tínaz Ekim, Z. Caner Taskin
Constructing extremal triangle-free graphs using integer programming. CoRR (2023)
Ömer Burak Onar, Tínaz Ekim, Z. Caner Taskin
Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem. SEA (2023)
Ali Erdem Banak, Tínaz Ekim, Z. Caner Taskin
Constructing extremal triangle-free graphs using integer programming. Discret. Optim. 50 (2023)
Emel Seyma Küçükasci, Mustafa Gökçe Baydogan, Z. Caner Taskin
Multiple instance classification via quadratic programming. J. Glob. Optim. 83 (4) (2022)
Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
Generation of random chordal graphs using subtrees of a tree. RAIRO Oper. Res. 56 (2) (2022)
Emel Seyma Küçükasci, Mustafa Gökçe Baydogan, Z. Caner Taskin
A linear programming approach to multiple instance learning. Turkish J. Electr. Eng. Comput. Sci. 29 (4) (2021)
Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane
A branch-cut-and-price algorithm for optimal decoding in digital communication systems. J. Glob. Optim. 81 (3) (2021)
Serkan Kalay, Z. Caner Taskin
Single machine campaign planning under sequence dependent family setups and co-production. J. Oper. Res. Soc. 72 (9) (2021)
Oylum Seker, Tínaz Ekim, Z. Caner Taskin
An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs. Eur. J. Oper. Res. 291 (1) (2021)
Serkan Kalay, Z. Caner Taskin
A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production. Comput. Oper. Res. 135 (2021)
Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane
A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems. Networks 75 (2) (2020)
Ali Tamer Ünal, Semra Agrali, Z. Caner Taskin
A strong integer programming formulation for hybrid flowshop scheduling. J. Oper. Res. Soc. 71 (12) (2020)
M. Asli Aydin, Z. Caner Taskin
Decentralized decomposition algorithms for peer-to-peer linear optimization. RAIRO Oper. Res. 54 (6) (2020)
Abdullah Sariduman, Ali Emre Pusane, Z. Caner Taskin
On the Construction of Regular QC-LDPC Codes With Low Error Floor. IEEE Commun. Lett. 24 (1) (2020)
I. Kuban Altinel, Necati Aras, Zeynep Suvak, Z. Caner Taskin
Minimum cost noncrossing flow problem on layered networks. Discret. Appl. Math. 261 (2019)
Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane
Optimization-based decoding algorithms for LDPC convolutional codes in communication systems. IISE Trans. 51 (10) (2019)
Oylum Seker, Tínaz Ekim, Z. Caner Taskin
A decomposition approach to solve the selective graph coloring problem in some perfect graph families. Networks 73 (2) (2019)
Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel
Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT). Comput. Oper. Res. 110 (2019)
Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel
The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT). Eur. J. Oper. Res. 272 (1) (2019)
Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
Generation of random chordal graphs using subtrees of a tree. CoRR (2018)
Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane
A Branch-Price-and-Cut Algorithm for Optimal Decoding of LDPC Codes. CoRR (2018)
Murat Güngör, Ali Tamer Ünal, Z. Caner Taskin
A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand. Int. J. Prod. Res. 56 (9) (2018)
Oylum Seker, Tínaz Ekim, Z. Caner Taskin
An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs. CoRR (2018)
Betül Ahat, Tínaz Ekim, Z. Caner Taskin
Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem. INFORMS J. Comput. 30 (1) (2018)
Z. Caner Taskin, J. Cole Smith
Branch-cut-price algorithms for solving a class of search problems on general graphs. Networks 70 (1) (2017)
Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane
A Branch-and-Cut Algorithm to Design LDPC Codes without Small Cycles in Communication Systems. CoRR (2017)
Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane
Optimization-Based Decoding Algorithms for LDPC Convolutional Codes in Communication Systems. CoRR (2017)
Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
Linear-Time Generation of Random Chordal Graphs. CIAC (2017)
Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel
Mathematical Models for Optimal Volumetric Modulated Arc Therapy (VMAT) Treatment Planning. CENTERIS/ProjMAN/HCist (2016)
Abdullah Sariduman, Ali Emre Pusane, Z. Caner Taskin
A heuristic method for adaptive linear programming decoding. SIU (2016)
Yavuz Bogaç Türkogullari, Z. Caner Taskin, Necati Aras, I. Kuban Altinel
Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals. Eur. J. Oper. Res. 254 (3) (2016)
Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane
A Branch-and-Price Algorithm for Optimal Decoding in LDPC-Based Communications. CTW (2015)
Z. Caner Taskin, Semra Agrali, Ali Tamer Ünal, Vahdet Belada, Filiz Gökten-Yilmaz
Mathematical Programming-Based Sales and Operations Planning at Vestel Electronics. Interfaces 45 (4) (2015)
Yavuz Bogaç Türkogullari, I. Kuban Altinel, Z. Caner Taskin, Zeynep Suvak, Necati Aras
Minimum Cost Noncrossing Flow Problem on a Layered Network. CTW (2015)
Yavuz Bogaç Türkogullari, Z. Caner Taskin, Necati Aras, I. Kuban Altinel
Optimal berth allocation and time-invariant quay crane assignment in container terminals. Eur. J. Oper. Res. 235 (1) (2014)
Abdullah Sariduman, Ali Emre Pusane, Z. Caner Taskin
Adaptive linear programming for decoding LDPC codes. SIU (2014)
Z. Caner Taskin, Mucahit Cevik
Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures. Comput. Oper. Res. 40 (9) (2013)
Merve Bodur, Tínaz Ekim, Z. Caner Taskin
Decomposition algorithms for solving the minimum weight maximal matching problem. Networks 62 (4) (2013)
Z. Caner Taskin, J. Cole Smith, H. Edwin Romeijn
Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures. Ann. Oper. Res. 196 (1) (2012)
Semra Agrali, Joseph Geunes, Z. Caner Taskin
A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements. J. Glob. Optim. 54 (3) (2012)
Z. Caner Taskin, Tínaz Ekim
Integer programming formulations for the minimum weighted maximal matching problem. Optim. Lett. 6 (6) (2012)
Abdullah Sariduman, Ali Emre Pusane, Z. Caner Taskin
An integer programming based trapping set search technique. SIU (2012)
Necati Aras, Yavuz Bogaç Türkogullari, Z. Caner Taskin, I. Kuban Altinel
Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals. OR (2012)
Z. Caner Taskin, J. Cole Smith, H. Edwin Romeijn, James F. Dempsey
Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning. Oper. Res. 58 (3) (2010)
Z. Caner Taskin, Ali Tamer Ünal
Tactical level planning in float glass manufacturing with co-production, random yields and substitutable products. Eur. J. Oper. Res. 199 (1) (2009)
Z. Caner Taskin, J. Cole Smith, Shabbir Ahmed, Andrew J. Schaefer
Cutting plane algorithms for solving a stochastic edge-partition problem. Discret. Optim. 6 (4) (2009)