Export 5 results:
Author Title Type [ Year(Desc)]
Filters: Author is Z C Taşkın and Keyword is integer programming  [Clear All Filters]
2019
Şeker, O., T. Ekim, and Z. C. Taşkın, "A decomposition approach to solve the selective graph coloring problem in some perfect graph families", Networks, vol. 73, pp. 145-169, 2019.
Dursun, P., Z. C. Taşkın, and K. I. Altinel, "The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT)", European Journal of Operational Research, vol. 272, pp. 372-388, 2019.
I. Altinel, K., N. Aras, Z. Şuvak, and Z. C. Taşkın, "Minimum cost noncrossing flow problem on layered networks", Discrete Applied Mathematics, vol. 261, pp. 2-21, 2019.
Dursun, P., Z. C. Taşkın, and K. I. Altinel, "Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT)", Computers & Operations Research, vol. 110, pp. 1-17, 2019.
2020
Kabakulak, B., Z. C. Taşkın, and A. E. Pusane, "A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems", Networks, vol. 75, pp. 137-157, 2020.