Export 9 results:
[ Author(Desc)] Title Type Year
Filters: First Letter Of Title is L  [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 
A
I. Altinel, K., E. Durmaz, N. Aras, and K. Can Özkisacik, "A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations", European Journal of Operational Research, vol. 198, pp. 790–799, 2009.
Aras, N., D. Aksen, and T. Tekin, "Location and selective routing problem with pricing for the collection of used products", Computers and Industrial Engineering (CIE), 2010 40th International Conference on: IEEE, pp. 1–6, 2010.
Aras, N., D. Aksen, and A. Gönül Tanuğur, "Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles", European Journal of Operational Research, vol. 191, no. 3: Elsevier, pp. 1223–1240, 2008.
Aras, N., and D. Aksen, "Locating collection centers for distance-and incentive-dependent returns", International Journal of Production Economics, vol. 111, no. 2: Elsevier, pp. 316–333, 2008.
B
Başdere, M., N. Aras, K. I. Altinel, and S. Afşar, "A leader-follower game for the point coverage problem in wireless sensor networks", European Journal of Industrial Engineering, vol. 7, no. 5: Inderscience Publishers, pp. 635–656, 2013.
Baydogan, M. Gokce, and G. Runger, "Learning a symbolic representation for multivariate time series classification", Data Mining and Knowledge Discovery, vol. 29, issue 2: Springer US, pp. 400-422, 03/2015.
K
M Keskin, E., K. I. Altinel, N. Aras, and C. Ersoy, "Lifetime maximization in wireless sensor networks using a mobile sink with nonzero traveling time", The Computer Journal: Oxford University Press, pp. bxr048, 2011.
Küçükaydın, H., N. Aras, and K. I. Altinel, "A leader–follower game in competitive facility location", Computers & Operations Research, vol. 39, no. 2: Elsevier, pp. 437–448, 2012.
Ş
Şeker, O., P. Heggernes, T. Ekim, and C. Z. Taşkın, "Linear-Time Generation of Random Chordal Graphs", International Conference on Algorithms and Complexity: Springer, 2017.