Z. Caner Taskin

Orcid: 0000-0002-9904-4315

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Constructing extremal triangle-free graphs using integer programming.
Discret. Optim., November, 2023

A Decomposition Algorithm for Single and Multiobjective Integrated Market Selection and Production Planning.
INFORMS J. Comput., 2023

Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

2022
Generation of random chordal graphs using subtrees of a tree.
RAIRO Oper. Res., 2022

Multiple instance classification via quadratic programming.
J. Glob. Optim., 2022

2021
Single machine campaign planning under sequence dependent family setups and co-production.
J. Oper. Res. Soc., 2021

A branch-cut-and-price algorithm for optimal decoding in digital communication systems.
J. Glob. Optim., 2021

An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs.
Eur. J. Oper. Res., 2021

A linear programming approach to multiple instance learning.
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.
Comput. Oper. Res., 2021

2020
Decentralized decomposition algorithms for peer-to-peer linear optimization.
RAIRO Oper. Res., 2020

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

A strong integer programming formulation for hybrid flowshop scheduling.
J. Oper. Res. Soc., 2020

On the Construction of Regular QC-LDPC Codes With Low Error Floor.
IEEE Commun. Lett., 2020

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

Optimization-based decoding algorithms for LDPC convolutional codes in communication systems.
IISE Trans., 2019

The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT).
Eur. J. Oper. Res., 2019

Minimum cost noncrossing flow problem on layered networks.
Discret. Appl. Math., 2019

Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT).
Comput. Oper. Res., 2019

2018
Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem.
INFORMS J. Comput., 2018

A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand.
Int. J. Prod. Res., 2018

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

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

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

Linear-Time Generation of Random Chordal Graphs.
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.
Eur. J. Oper. Res., 2016

A heuristic method for adaptive linear programming decoding.
Proceedings of the 24th Signal Processing and Communication Application Conference, 2016

Mathematical Models for Optimal Volumetric Modulated Arc Therapy (VMAT) Treatment Planning.
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.
Interfaces, 2015

Minimum Cost Noncrossing Flow Problem on a Layered Network.
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.
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.
Eur. J. Oper. Res., 2014

Adaptive linear programming for decoding LDPC codes.
Proceedings of the 2014 22nd Signal Processing and Communications Applications Conference (SIU), 2014

2013
Decomposition algorithms for solving the minimum weight maximal matching problem.
Networks, 2013

Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures.
Comput. Oper. Res., 2013

2012
Integer programming formulations for the minimum weighted maximal matching problem.
Optim. Lett., 2012

A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements.
J. Glob. Optim., 2012

Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures.
Ann. Oper. Res., 2012

An integer programming based trapping set search technique.
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.
Proceedings of the Operations Research Proceedings 2012, 2012

2010
Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning.
Oper. Res., 2010

2009
Tactical level planning in float glass manufacturing with co-production, random yields and substitutable products.
Eur. J. Oper. Res., 2009

Cutting plane algorithms for solving a stochastic edge-partition problem.
Discret. Optim., 2009


  Loading...