Z. Caner Taskin

According to our database, Z. Caner Taskin authored at least 42 papers between 2009 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Constructing extremal triangle-free graphs using integer programming.

Ali Erdem Banak, Tínaz Ekim, Z. Caner Taskin

Discret. Optim., November, 2023

Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem.

Ömer Burak Onar, Tínaz Ekim, Z. Caner Taskin

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

2022

Generation of random chordal graphs using subtrees of a tree.

Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin

RAIRO Oper. Res., 2022

Multiple instance classification via quadratic programming.

Emel Seyma Küçükasci, Mustafa Gökçe Baydogan, Z. Caner Taskin

J. Glob. Optim., 2022

2021

Single machine campaign planning under sequence dependent family setups and co-production.

Serkan Kalay, Z. Caner Taskin

J. Oper. Res. Soc., 2021

A branch-cut-and-price algorithm for optimal decoding in digital communication systems.

Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane

J. Glob. Optim., 2021

An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs.

Oylum Seker, Tínaz Ekim, Z. Caner Taskin

Eur. J. Oper. Res., 2021

A linear programming approach to multiple instance learning.

Emel Seyma Küçükasci, Mustafa Gökçe Baydogan, Z. Caner Taskin

Turkish J. Electr. Eng. Comput. Sci., 2021

A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production.

Serkan Kalay, Z. Caner Taskin

Comput. Oper. Res., 2021

2020

Decentralized decomposition algorithms for peer-to-peer linear optimization.

M. Asli Aydin, Z. Caner Taskin

RAIRO Oper. Res., 2020

A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems.

Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane

Networks, 2020

A strong integer programming formulation for hybrid flowshop scheduling.

Ali Tamer Ünal, Semra Agrali, Z. Caner Taskin

J. Oper. Res. Soc., 2020

On the Construction of Regular QC-LDPC Codes With Low Error Floor.

Abdullah Sariduman, Ali Emre Pusane, Z. Caner Taskin

IEEE Commun. Lett., 2020

2019

A decomposition approach to solve the selective graph coloring problem in some perfect graph families.

Oylum Seker, Tínaz Ekim, Z. Caner Taskin

Networks, 2019

Optimization-based decoding algorithms for LDPC convolutional codes in communication systems.

Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane

IISE Trans., 2019

The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT).

Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel

Eur. J. Oper. Res., 2019

Minimum cost noncrossing flow problem on layered networks.

I. Kuban Altinel, Necati Aras, Zeynep Suvak, Z. Caner Taskin

Discret. Appl. Math., 2019

Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT).

Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel

Comput. Oper. Res., 2019

2018

Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem.

Betül Ahat, Tínaz Ekim, Z. Caner Taskin

INFORMS J. Comput., 2018

A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand.

Murat Güngör, Ali Tamer Ünal, Z. Caner Taskin

Int. J. Prod. Res., 2018

A Branch-Price-and-Cut Algorithm for Optimal Decoding of LDPC Codes.

Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane

CoRR, 2018

2017

Branch-cut-price algorithms for solving a class of search problems on general graphs.

Z. Caner Taskin, J. Cole Smith

Networks, 2017

A Branch-and-Cut Algorithm to Design LDPC Codes without Small Cycles in Communication Systems.

Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane

CoRR, 2017

Linear-Time Generation of Random Chordal Graphs.

Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals.

Yavuz Bogaç Türkogullari, Z. Caner Taskin, Necati Aras, I. Kuban Altinel

Eur. J. Oper. Res., 2016

A heuristic method for adaptive linear programming decoding.

Abdullah Sariduman, Ali Emre Pusane, Z. Caner Taskin

Proceedings of the 24th Signal Processing and Communication Application Conference, 2016

Mathematical Models for Optimal Volumetric Modulated Arc Therapy (VMAT) Treatment Planning.

Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel

Proceedings of the International Conference on ENTERprise Information Systems/International Conference on Project MANagement/International Conference on Health and Social Care Information Systems and Technologies, 2016

2015

Mathematical Programming-Based Sales and Operations Planning at Vestel Electronics.

Z. Caner Taskin, Semra Agrali, Ali Tamer Ünal, Vahdet Belada, Filiz Gökten-Yilmaz

Interfaces, 2015

Minimum Cost Noncrossing Flow Problem on a Layered Network.

Yavuz Bogaç Türkogullari, I. Kuban Altinel, Z. Caner Taskin, Zeynep Suvak, Necati Aras

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

A Branch-and-Price Algorithm for Optimal Decoding in LDPC-Based Communications.

Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Optimal berth allocation and time-invariant quay crane assignment in container terminals.

Yavuz Bogaç Türkogullari, Z. Caner Taskin, Necati Aras, I. Kuban Altinel

Eur. J. Oper. Res., 2014

Adaptive linear programming for decoding LDPC codes.

Abdullah Sariduman, Ali Emre Pusane, Z. Caner Taskin

Proceedings of the 2014 22nd Signal Processing and Communications Applications Conference (SIU), 2014

2013

Decomposition algorithms for solving the minimum weight maximal matching problem.

Merve Bodur, Tínaz Ekim, Z. Caner Taskin

Networks, 2013

Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures.

Z. Caner Taskin, Mucahit Cevik

Comput. Oper. Res., 2013

2012

Integer programming formulations for the minimum weighted maximal matching problem.

Z. Caner Taskin, Tínaz Ekim

Optim. Lett., 2012

A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements.

Semra Agrali, Joseph Geunes, Z. Caner Taskin

J. Glob. Optim., 2012

Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures.

Z. Caner Taskin, J. Cole Smith, H. Edwin Romeijn

Ann. Oper. Res., 2012

An integer programming based trapping set search technique.

Abdullah Sariduman, Ali Emre Pusane, Z. Caner Taskin

Proceedings of the 20th Signal Processing and Communications Applications Conference, 2012

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals.

Necati Aras, Yavuz Bogaç Türkogullari, Z. Caner Taskin, I. Kuban Altinel

Proceedings of the Operations Research Proceedings 2012, 2012

2010

Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning.

Z. Caner Taskin, J. Cole Smith, H. Edwin Romeijn, James F. Dempsey

Oper. Res., 2010

2009

Tactical level planning in float glass manufacturing with co-production, random yields and substitutable products.

Z. Caner Taskin, Ali Tamer Ünal

Eur. J. Oper. Res., 2009

Cutting plane algorithms for solving a stochastic edge-partition problem.

Z. Caner Taskin, J. Cole Smith, Shabbir Ahmed, Andrew J. Schaefer

Discret. Optim., 2009