18 sonucu aktar:
Yazar [ Başlık(Desc)] Tür Yıl
Süzgeçler: First Letter Of Title: B  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
B
Baydogan, M. Gokce, G. Runger, and E. Tuv, "A Bag-of-Features Framework to Classify Time Series", IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, pp. 2796-2802, 2013.
Kavlak, K. Bayramoğl, and B.( I. Bairamov), "Baker- Lin-Huang Type Bivariate Distributions Based on Order Statistics", Communications in Statistics - Theory and Methods, vol. 43, pp. 1992-2006, 2014.
Ünal, A. Tamer, and A. S. Kiran, "BATCH SEQUENCING", IIE Transactions, vol. 24, pp. 73-83, 1992.
Adıyeke, E., and M. Gokce Baydogan, "The benefits of target relations: A comparison of multitask extensions and classifier chains", Pattern Recognition, vol. 107, pp. 107507, 2020.
Aksen, D., and N. Aras, "A bilevel fixed charge location model for facilities under imminent attack", Computers & Operations Research, vol. 39, no. 7: Pergamon, pp. 1364–1381, 2012.
Aras, N., and H. Küçükaydın, "Bilevel Models on the Competitive Facility Location Problem", Spatial Interaction Models: Springer, pp. 1–19, 2017.
Aksen, D., S. Şengül Akca, and N. Aras, "A bilevel partial interdiction problem with capacitated facilities and demand outsourcing", Computers & Operations Research, vol. 41: Pergamon, pp. 346–358, 2014.
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.
I. Altinel, K., N. Aras, E. Güney, and C. Ersoy, "Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks", Computer Networks, vol. 52, pp. 2419–2431, 2008.
Leydold, J., and W. Hörmann, "Black Box Algorithms for Generating Non-Uniform Continuous Random Variates", COMPSTAT 2000. Short Communications and Posters: Statistics Netherlands, pp. 53–54, 2000.
Hörmann, W., and J. Leydold, "Black-Box Algorithms for Sampling from Continuous Distributions", Proceedings of the 2006 Winter Simulation Conference, pp. 129–136, 2006.
Ekim, T., and A. Erey, "Block decomposition approach to compute a minimum geodetic set", RAIRO-Operations Research, vol. 48, no. 04: EDP Sciences, pp. 497–507, 2014.
M Akyüz, H., T. Öncan, and K. I. Altinel, "Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem", Annals of Operations Research, vol. 279, pp. 1–42, 2019.
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.
Kalay, S., and Z. C. Taşkın, "A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production", Computers & Operations Research, vol. 135, pp. 105430, 2021.
Taşkın, Z. C., and C. J. Smith, "Branch-cut-price algorithms for solving a class of search problems on general graphs", Networks, vol. 70, pp. 4-18, 2017.
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.