default search action
Z. Caner Taskin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j32]Ali Erdem Banak, Tínaz Ekim, Z. Caner Taskin:
Constructing extremal triangle-free graphs using integer programming. Discret. Optim. 50: 100802 (2023) - [j31]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): 1439-1453 (2023) - [c7]Ömer Burak Onar, Tínaz Ekim, Z. Caner Taskin:
Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem. SEA 2023: 13:1-13:18 - [i8]Ali Erdem Banak, Tínaz Ekim, Z. Caner Taskin:
Constructing extremal triangle-free graphs using integer programming. CoRR abs/2304.01729 (2023) - 2022
- [j30]Emel Seyma Küçükasci, Mustafa Gökçe Baydogan
Multiple instance classification via quadratic programming. J. Glob. Optim. 83(4): 639-670 (2022) - [j29]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): 565-582 (2022) - 2021
- [j28]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: 105430 (2021) - [j27]Emel Seyma Küçükasci, Mustafa Gökçe Baydogan
A linear programming approach to multiple instance learning. Turkish J. Electr. Eng. Comput. Sci. 29(4): 2186-2201 (2021) - [j26]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): 67-83 (2021) - [j25]Banu Kabakulak
A branch-cut-and-price algorithm for optimal decoding in digital communication systems. J. Glob. Optim. 81(3): 805-834 (2021) - [j24]Serkan Kalay
Single machine campaign planning under sequence dependent family setups and co-production. J. Oper. Res. Soc. 72(9): 2091-2111 (2021) - 2020
- [j23]Abdullah Sariduman
On the Construction of Regular QC-LDPC Codes With Low Error Floor. IEEE Commun. Lett. 24(1): 25-28 (2020) - [j22]Ali Tamer Ünal, Semra Agrali
A strong integer programming formulation for hybrid flowshop scheduling. J. Oper. Res. Soc. 71(12): 2042-2052 (2020) - [j21]Banu Kabakulak
A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems. Networks 75(2): 137-157 (2020) - [j20]M. Asli Aydin
Decentralized decomposition algorithms for peer-to-peer linear optimization. RAIRO Oper. Res. 54(6): 1835-1861 (2020)
2010 – 2019
- 2019
- [j19]Pinar Dursun, Z. Caner Taskin
Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT). Comput. Oper. Res. 110: 1-17 (2019) - [j18]I. Kuban Altinel
Minimum cost noncrossing flow problem on layered networks. Discret. Appl. Math. 261: 2-21 (2019) - [j17]Pinar Dursun, Z. Caner Taskin
The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT). Eur. J. Oper. Res. 272(1): 372-388 (2019) - [j16]Banu Kabakulak
Optimization-based decoding algorithms for LDPC convolutional codes in communication systems. IISE Trans. 51(10): 1061-1074 (2019) - [j15]Oylum Seker
A decomposition approach to solve the selective graph coloring problem in some perfect graph families. Networks 73(2): 145-169 (2019) - 2018
- [j14]Murat Güngör
A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand. Int. J. Prod. Res. 56(9): 3344-3357 (2018) - [j13]Betül Ahat
Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem. INFORMS J. Comput. 30(1): 43-56 (2018) - [i7]Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane:
A Branch-Price-and-Cut Algorithm for Optimal Decoding of LDPC Codes. CoRR abs/1803.04798 (2018) - [i6]Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin:
Generation of random chordal graphs using subtrees of a tree. CoRR abs/1810.13326 (2018) - [i5]Oylum Seker, Tínaz Ekim, Z. Caner Taskin:
An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs. CoRR abs/1811.12094 (2018) - 2017
- [j12]Z. Caner Taskin, J. Cole Smith
Branch-cut-price algorithms for solving a class of search problems on general graphs. Networks 70(1): 4-18 (2017) - [c6]Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin:
Linear-Time Generation of Random Chordal Graphs. CIAC 2017: 442-453 - [i4]Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane:
Optimization-Based Decoding Algorithms for LDPC Convolutional Codes in Communication Systems. CoRR abs/1708.05618 (2017) - [i3]Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane:
A Branch-and-Cut Algorithm to Design LDPC Codes without Small Cycles in Communication Systems. CoRR abs/1709.09936 (2017) - 2016
- [j11]Yavuz Bogaç Türkogullari
Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals. Eur. J. Oper. Res. 254(3): 985-1001 (2016) - [c5]Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel:
Mathematical Models for Optimal Volumetric Modulated Arc Therapy (VMAT) Treatment Planning. CENTERIS/ProjMAN/HCist 2016: 644-651 - [c4]Abdullah Sariduman, Ali Emre Pusane, Z. Caner Taskin:
A heuristic method for adaptive linear programming decoding. SIU 2016: 1665-1668 - 2015
- [j10]Z. Caner Taskin
Mathematical Programming-Based Sales and Operations Planning at Vestel Electronics. Interfaces 45(4): 325-340 (2015) - [i2]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: 129-132 - [i1]Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane:
A Branch-and-Price Algorithm for Optimal Decoding in LDPC-Based Communications. CTW 2015: 141-144 - 2014
- [j9]Yavuz Bogaç Türkogullari
Optimal berth allocation and time-invariant quay crane assignment in container terminals. Eur. J. Oper. Res. 235(1): 88-101 (2014) - [c3]Abdullah Sariduman, Ali Emre Pusane, Z. Caner Taskin
Adaptive linear programming for decoding LDPC codes. SIU 2014: 706-709 - 2013
- [j8]Z. Caner Taskin
Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures. Comput. Oper. Res. 40(9): 2178-2186 (2013) - [j7]Merve Bodur
Decomposition algorithms for solving the minimum weight maximal matching problem. Networks 62(4): 273-287 (2013) - 2012
- [j6]Z. Caner Taskin
Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures. Ann. Oper. Res. 196(1): 799-818 (2012) - [j5]Semra Agrali
A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements. J. Glob. Optim. 54(3): 551-581 (2012) - [j4]Z. Caner Taskin
Integer programming formulations for the minimum weighted maximal matching problem. Optim. Lett. 6(6): 1161-1171 (2012) - [c2]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: 101-107 - [c1]Abdullah Sariduman, Ali Emre Pusane, Z. Caner Taskin
An integer programming based trapping set search technique. SIU 2012: 1-4 - 2010
- [j3]Z. Caner Taskin
Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning. Oper. Res. 58(3): 674-690 (2010)
2000 – 2009
- 2009
- [j2]Z. Caner Taskin
Cutting plane algorithms for solving a stochastic edge-partition problem. Discret. Optim. 6(4): 420-435 (2009) - [j1]Z. Caner Taskin
Tactical level planning in float glass manufacturing with co-production, random yields and substitutable products. Eur. J. Oper. Res. 199(1): 252-261 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-08 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: