10 sonucu aktar:
Yazar Başlık [ Tür(Desc)] Yıl
Süzgeçler: First Letter Of Last Name: P  [Clear All Filters]
Journal Article
Ekim, T., and V. Th Paschos, "Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa", International Journal of Computer Mathematics, vol. 81, no. 5: Taylor & Francis Group, pp. 569–582, 2004.
Aksen, D., N. Aras, and N. Piyade, "A bilevel p-median model for the planning and protection of critical facilities", Journal of Heuristics, vol. 19, no. 2: Springer US, pp. 373–398, 2013.
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.
Kabakulak, B., Z. C. Taşkın, and A. Emre Pusane, "A Branch-Price-and-Cut Algorithm for Optimal Decoding of LDPC Codes", Journal of Global Optimization, vol. 81, pp. 805–834, 2021.
Aksen, D., N. Piyade, and N. Aras, "The budget constrained r-interdiction median problem with capacity expansion", Central European Journal of Operations Research, vol. 18, no. 3: Springer-Verlag, pp. 269–291, 2010.
Ekim, T., A. M. Farley, and A. Proskurowski, "The complexity of the defensive domination problem in special graph classes", Discrete Mathematics, vol. 343, pp. 111665, 2020.
Sarıduman, A., A. E. Pusane, and Z. C. Taşkın, "On the Construction of Regular QC-LDPC Codes With Low Error Floor", IEEE Communications Letters, vol. 24, pp. 25-28, 2020.
Sarıduman, A., A. Emre Pusane, and Z. C. Taşkın, "An Integer Programming-Based Search Technique for Error-Prone Substructures of LDPC Codes", AEU - International Journal of Electronics and Communications, vol. 68, issue 11, pp. 1097-1105, 2014.
Kabakulak, B., Z. C. Taşkın, and A. Emre Pusane, "Optimization–based decoding algorithms for LDPC convolutional codes in communication systems", IISE Transactions, vol. 51, pp. 1061-1074, 2019.
Bilge, Ü., F. Kıraç, M. Kurtulan, and P. Pekgün, "A tabu search algorithm for parallel machine total tardiness problem", Computers & Operations Research, vol. 31, no. 3: Elsevier, pp. 397–414, 2004.