- IE 202 Operations Research I: Linear Models (Fall 2006, Fall 2007, Fall 2008, Fall 2009)
- IE 256 Statistics for Industrial Engineers (Spring 2006, Spring 2007, Spring 2008, Spring 2009)
- IE 304 Operations Research III: Stochastic Models (Spring 2005)
- IE 310 Operations Research (Fall 2004, Fall 2005, Summer 2008, Fall 2009)
- IE 517 Heuristic Methods in Optimization (Fall 2006, Fall 2007, Fall 2008)
- IE 580 Special Topics Heuristic Methods (Fall 2004, Fall 2005)
|
- Aksen D., Aras N., and Karaarslan G. (2009). "Design and Analysis of Government-Subsidized Collection Systems for Incentive-Dependent Returns" International Journal of Production Economics Vol. 119, (2): 308–327.
- Türkogullari, Y., Aras, N., Altmel İ. K., Ersoy, C., "Optimal Placement, Scheduling, and Routing to Maximize Lifetime in Sensor Networks" Journal of the Operational Society, (2009) to appear.
- Altınel, İ. K., Durmaz, E., Aras, N., Özkısacık, K. C., "A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations" European Journal of Operational Research, (2009) to appear.
- Durmaz, E., Aras, N., Altınel, İ. K., "Discrete approximation heuristics for the capacitated multisource Weber problem with probabilistic customer locations" Computers and Operations Research(2009): 2139 – 2148.
- Özkısacık, K. C., Altınel, İ. K., Aras, N., "Solving probabilistic multi-facility Weber problem by vector quantization" OR Spectrum, (2009) to appear.
- Altınel, İ. K., N. Aras, E. Güney and C. Ersoy (2008). "Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks." Computer Networks 52(12): 2419–2431.
- Aras N., Aksen D., and Tanuğur A.G. (2008). "Locating Collection Centers For Incentive-Dependent Returns under a Pick-up Policy with Capacitated Vehicles" IEuropean Journal of Operational Research, Vol. 191, (3): 1223–1240.
- Aras N. and Aksen D. (2008). "Locating Collection Centers For Distance and Incentive Dependent Returns" International Journal of Production Economics, Vol. 111, (2): 316–333.
- Aras, N., M. Orbay and İ. K. Altınel (2008). "Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem." Journal of the Operational Research Society 59(1): 64-79.
- Aras, N. and D. Aksen (2008). "Locating collection centers for distance- and incentive-dependent returns." International Journal of Production Economics 111(2): 316-333.
- Altınel, İ. K., N. Aras, E. Güney and C. Ersoy (2008). "Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks." Computer Networks 52(12): 2419-2431.
- Aksen, D., Z. Özyurt and N. Aras (2007). "Open vehicle routing problem with driver nodes and time deadlines." Journal of the Operational Research Society. 58(9): 1223-1234.
- Aras, N., İ. K. Altınel and M. Orbay (2007). "New heuristic methods for the capacitated multi-facility Weber problem." Naval Research Logistics. 54(1): 21.
- Aras, N., K. C. Özkısacık and İ. K. Altınel (2006). "Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps." Journal of the Operational Research Society. 57: 82-93.
- Aras, N., V. Verter and T. Boyacı (2006). "Coordination and priority decisions in hybrid manufacturing/remanufacturing systems." Production and Operations Management. 15(4): 528-543.
- Aras, N., S. Yumuşak and İ. K. Altınel (2006). Solving the capacitated multi-facility Weber problem by simulated annealing, threshold accepting and genetic algorithms. Metaheuristics - Progress in Complex Systems Optimization. K. F. Doerner, M. Gendreau, P. Greistorferet al, Springer.
- Ray, S., T. Boyacı and N. Aras (2005). "Optimal prices and trade-in rebates for durable, remanufacturable products." Manufacturing & Service Operations Management. 7(3): 208.
- Aras, N., T. Boyacı and V. Verter (2004). "The effect of categorizing returned products in remanufacturing." IIE Transactions. 36(4): 319-331.
- Aras, N., İ. K. Altınel and J. Oommen (2003). "A Kohonen-like decomposition method for the Euclidean traveling salesman problem - KNIES_DECOMPOSE." IEEE Transactions on Neural Networks. 14(4): 869-890.
|