Export 66 results:
Author Title [ Type(Desc)] Year
Filters: First Letter Of Last Name is O  [Clear All Filters]
Book
M. Akyüz, H., T. Öncan, and K. I. Altinel, "Efficient Lower and Upper Bounds for the Multi-commodity Capacitated Multi-facility Weber Problem with Rectilinear Distances", Logistik Management, 2009.
Book Chapter
Ekşioğlu, M., E. Kiris, B. \ cCapar, M. N. Selçuk, and S. Ouzeir, "Heuristic evaluation and usability testing: case study", Internationalization, Design and Global Development: Springer Berlin Heidelberg, pp. 143–151, 2011.
Özyurt, Z., D. Aksen, and N. Aras, "Open vehicle routing problem with time deadlines: Solution methods and an application", Operations Research Proceedings 2005: Springer Berlin Heidelberg, pp. 73–78, 2006.
Karademir, C., Ü. Bilge, N. Aras, G. Burak Akkuş, G. Öznergiz, and O. Doğan, "Solution of a Real-Life Vehicle Routing Problem with Meal Breaks and Shifts", Green Transportation and New Advances in Vehicle Routing Problems: Springer International Publishing, pp. 131–157, 2020.
B Oommen, J., N. Aras, and K. I. Altinel, "Solving the Travelling Salesman Problem using the Kohonen Network Incorporating Explicit Statistics", Neural Nets WIRN VIETRI-98: Springer London, pp. 273–282, 1999.
Conference Paper
Oommen, J., K. I. Altinel, and N. Aras, "Arbitrary distance function estimation using discrete vector quantization", Neural Networks, 1997., International Conference on, vol. 2: IEEE, pp. 1272–1277, 1997.
Oommen, J., K. I. Altinel, and N. Aras, "Arbitrary distance function estimation using vector quantization", International Symposium on Neural Networks, 1995.
Aras, N., K. I. Altinel, and J. B Oommen, "A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE.", ECAI, pp. 261–265, 2000.
Aras, N., K. I. Altinel, and J. Oommen, "A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE", European Conference on Artificial Intelligence, pp. 261–265, 2000.
I. Altinel, K., N. Aras, and BJ. Oommen, "A self-organizing method for map reconstruction", Neural Networks for Signal Processing, 2003. NNSP'03. 2003 IEEE 13th Workshop on: IEEE, pp. 677–687, 2003.
Conference Proceedings
Küçük, B.., N. Önsel, and B.. Eskici, "A Dynamic Simulation Model of Academic Publications and Citations", 26th International Conference of the System Dynamics Society, 2008.
Özgün, O., and Y. Barlas, "Effects of Delay, Nonlinearity and Feedback on the Overall Complexity of a Stock Management Game", 30th International Conference of the System Dynamics Society, 2012.
Önsel, N., E.. Önsel, and G. Yücel, "Evaluation of Alternative Dynamic Behavior Representations for Automated Model Output Classification and Clustering", 31st International Conference of the System Dynamics Society, 2013.
Önsel, N., E.. Önsel, and G. Yücel, "Evaluation of Alternative Dynamic Behavior Representations for Automated Model Output Classification and Clustering", 31st International Conference of the System Dynamics Society, 2013.
Önsel, N., and Y. Barlas, "Modeling the Dynamics of Academic Publications and Citations", 29th International Conference of the System Dynamics Society, 2011.
Bacaksızlar, N.. G., and N. Önsel, "Modeling the Dynamics of Methylmercury Biomagnification", 31st International Conference of the System Dynamics Society, 2013.
Özgün, O., and Y. Barlas, "Systemic Complexity of a Growth Management Game: Comparative Analysis of Decision Heuristics and Experimental Results", 30th International Conference of the System Dynamics Society, 2012.
Journal Article
Öncan, T., Z. Şuvak, H. M. Akyüz, and K. I. Altinel, "Assignment problem with conflicts", Computers & Operations Research, vol. 111, pp. 214-229, 2019.
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.
Dursun, P., Z. C. Taşkın, K. I. Altinel, H. Bilge, N. Dönmez Kesen, M. Okutan, and E. Nezih Oral, "A column generation heuristic for VMAT planning with adaptive CVaR constraints", Physics in Medicine {&} Biology, vol. 64, pp. 205024, oct, 2019.
Dursun, P., Z. C. Taşkın, K. I. Altinel, H. Bilge, N. Dönmez Kesen, M. Okutan, and E. Nezih Oral, "A column generation heuristic for VMAT planning with adaptive CVaR constraints", Physics in Medicine {&} Biology, vol. 64, pp. 205024, oct, 2019.
Ozcan, E. C., B. Görgülü, and M. Gokce Baydogan, "Column generation-based prototype learning for optimizing area under the receiver operating characteristic curve", European Journal of Operational Research, vol. 314, pp. 297–307, 2024.
Öncan, T., K. I. Altinel, and G. Laporte, "A comparative analysis of several asymmetric traveling salesman problem formulations", Computers & Operations Research, vol. 36, pp. 637–654, 2009.
Feyzioglu, O., K. I. Altinel, and S. Özekici, "The design of optimum component test plans for system reliability", Computational Statistics & Data Analysis, vol. 50, pp. 3099–3112, 2006.
Oommen, J., K. I. Altinel, and N. Aras, "Discrete vector quantization for arbitrary distance function estimation", IEEE Transactions on Systems, Man, and Cybernetics, vol. 28, pp. 496–510, 1998.
I. Altinel, K., and S. Özekici, "Dynamic component testing of a series system with redundant subsystems", Iie Transactions, vol. 33, pp. 1093–1108, 2001.
Öner, S., and T. Bilgiç, "Economic lot scheduling with uncontrolled co-production", European Journal of Operational Research, vol. 188, no. 3: Elsevier, pp. 793–810, 2008.
Aras, N., M. Orbay, and K. I. Altinel, "Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem", Journal of the Operational Research Society, vol. 59, no. 1: Nature Publishing Group, pp. 64–79, 2008.
Öncan, T., and K. I. Altinel, "Exact solution procedures for the balanced unidirectional cyclic layout problem", European Journal of Operational Research, vol. 189, pp. 609–623, 2008.
I. Altinel, K., N. Aras, and J. Oommen, "Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches", Computers & Operations Research, vol. 27, pp. 461–494, 2000.

Pages