I agree that this site is using cookies. You can find further informations here.
X
Taşkın, Z. Caner
96  results:
Search for persons X
?
1

A Decomposition Algorithm for Single and Multiobjective Int..:

van den Heuvel, Wilco ; Ağralı, Semra ; Taşkın, Z. Caner
INFORMS Journal on Computing.  35 (2023)  6 - p. 1439-1453 , 2023
Link: https://doi.org/10.1287/..
 
?
2

Constructing extremal triangle-free graphs using integer pr..:

Banak, Ali Erdem ; Ekim, Tınaz ; Taşkın, Z. Caner
Discrete Optimization.  50 (2023)  - p. 100802 , 2023
Link: https://doi.org/10.1016/..
 
?
3

A lot-sizing problem in deliberated and controlled co-produ..:

Pamuk, Bahadır ; Ağralı, Semra ; Taşkın, Z. Caner.
IISE Transactions.  54 (2022)  10 - p. 950-962 , 2022
Link: https://doi.org/10.1080/..
 
?
4

Multiple instance classification via quadratic programming:

Küçükaşcı, Emel Şeyma ; Baydoğan, Mustafa Gökçe ; Taşkın, Z. Caner
Journal of Global Optimization.  83 (2022)  4 - p. 639-670 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Generation of random chordal graphs using subtrees of a tre:

Şeker, Oylum ; Heggernes, Pinar ; Ekim, Tinaz.
RAIRO - Operations Research.  56 (2022)  2 - p. 565-582 , 2022
Link: https://doi.org/10.1051/..
 
?
6

A branch-and-price algorithm for parallel machine campaign ..:

Kalay, Serkan ; Taşkın, Z. Caner
Computers & Operations Research.  135 (2021)  - p. 105430 , 2021
Link: https://doi.org/10.1016/..
 
?
7

A branch-cut-and-price algorithm for optimal decoding in di..:

Kabakulak, Banu ; Taşkın, Z. Caner ; Pusane, Ali Emre
Journal of Global Optimization.  81 (2021)  3 - p. 805-834 , 2021
Link: https://doi.org/10.1007/..
 
?
8

An exact cutting plane algorithm to solve the selective gra..:

Şeker, Oylum ; Ekim, Tınaz ; Taşkın, Z. Caner
European Journal of Operational Research.  291 (2021)  1 - p. 67-83 , 2021
Link: https://doi.org/10.1016/..
 
?
9

Single machine campaign planning under sequence dependent f..:

Kalay, Serkan ; Taşkın, Z. Caner
Journal of the Operational Research Society.  72 (2020)  9 - p. 2091-2111 , 2020
Link: https://doi.org/10.1080/..
 
?
10

A strong integer programming formulation for hybrid flowsho..:

Ünal, A. Tamer ; Ağralı, Semra ; Taşkın, Z. Caner
Journal of the Operational Research Society.  71 (2019)  12 - p. 2042-2052 , 2019
Link: https://doi.org/10.1080/..
 
?
11

A branch‐and‐cut algorithm for a bipartite graph constructi..:

Kabakulak, Banu ; Taşkin, Z. Caner ; Pusane, Ali E.
Networks.  75 (2019)  2 - p. 137-157 , 2019
Link: https://doi.org/10.1002/..
 
?
12

The determination of optimal treatment plans for Volumetric..:

Dursun, Pınar ; Taşkın, Z. Caner ; Altınel, İ. Kuban
European Journal of Operational Research.  272 (2019)  1 - p. 372-388 , 2019
Link: https://doi.org/10.1016/..
 
?
13

Minimum cost noncrossing flow problem on layered networks:

Altınel, İ. Kuban ; Aras, Necati ; Şuvak, Zeynep.
Discrete Applied Mathematics.  261 (2019)  - p. 2-21 , 2019
Link: https://doi.org/10.1016/..
 
?
14

Optimization–based decoding algorithms for LDPC convolution..:

Kabakulak, Banu ; Taşkın, Z. Caner ; Emre Pusane, Ali
IISE Transactions.  51 (2019)  10 - p. 1061-1074 , 2019
Link: https://doi.org/10.1080/..
 
?
15

Using branch-and-price to determine optimal treatment plans..:

Dursun, Pınar ; Taşkın, Z. Caner ; Altınel, İ. Kuban
Computers & Operations Research.  110 (2019)  - p. 1-17 , 2019
Link: https://doi.org/10.1016/..
 
1-15