Æȷοì
Belma Yelbay
Belma Yelbay
¼Ò¼ÓÀ» ¾Ë ¼ö ¾øÀ½
sabanciuniv.eduÀÇ À̸ÞÀÏ È®ÀεÊ
Á¦¸ñ
Àοë
Àοë
¿¬µµ
The set covering problem revisited: an empirical study of the value of dual information
B Yelbay, Şİ Birbil, K Bülbül
Journal of Industrial and Management Optimization, 2014
672014
Approximating the minimum hub cover problem on planar graphs
B Yelbay, Şİ Birbil, K Bülbül, H Jamil
Optimization Letters 10 (1), 33-45, 2016
92016
Primal-dual heuristics for solving the set covering problem
B Yelbay
52010
Minimum hub cover problem: Solution methods and applications
B Yelbay
32014
Trade-offs computing minimum hub cover toward optimized graph query processing
B Yelbay, SI Birbil, K Bulbul, HM Jamil
arXiv preprint arXiv:1311.1626, 2013
32013
Ranking novel regulatory genes in gene expression profiles using NetExpress
B Yelbay, A Gow, HM Jamil
Proceedings of the Symposium on Applied Computing, 24-27, 2017
12017
Trade-offs computing minimum hub cover toward optimized labeled graph query processing
B Yelbay, Şİ Birbil, K Bülbül, HM Jamil
AJIT-e: Academic Journal of Information Technology 9 (33), 39-68, 2018
2018
Mathematical programming models based on hub covers in graph query processing
B Yelbay, Şİ Birbil, K Bülbül
2017
The set covering problem revisited: An empirical study of the value of dual information
B Yelbay, Şİ Birbil, K Bülbül
Journal of industrial and management optimization 11 (2), 575-594, 2015
2015
Mathematical Programming Models and Their Relaxations for The Minimum Hub Cover Problem
B Yelbay, SI Birbil, K Bülbül
Taming The Set Covering Problem: The Value of Dual Information
B Yelbay, SI Birbil, K Bülbül
ÇöÀç ½Ã½ºÅÛÀÌ ÀÛµ¿µÇÁö ¾Ê½À´Ï´Ù. ³ªÁß¿¡ ´Ù½Ã ½ÃµµÇØ ÁÖ¼¼¿ä.
ÇмúÀÚ·á 1–11