Z. Caner Taskin

48 papers B 1C 3Journal 39Unranked 5

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