İ. Kuban Altınel

Email: 
altinel@bogazici.edu.tr
Phone: 
7076
 
B.S. in IE, Istanbul Technical University, 1982;
M.S. in IE  OR, Columbia University, 1985;
M.S. in IE, University of Pittsburgh, 1989;
Ph.D. in IE, University of Pittsburgh, 1990.
Faculty Member in the Department since: 1991
Research Interests: 
Linear and combinatorial optimization, Graphs and network flows, Mathematical programming applications in statistics and machine learning, Wireless sensor networks, Social Networks

Offered courses

Recent publications

  1. The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals, M. Akyüz, Hakan, Öncan Temel, and I. Altinel Kuban , Iie Transactions, Volume 42, p.825–841, (2010)
  2. An efficient heuristic for placement, scheduling and routing in wireless sensor networks, Türkogullari, Yavuz Bogaç, Aras Necati, I. Altinel Kuban, and Ersoy Cem , Ad Hoc Networks, Volume 8, p.654–667, (2010)
  3. A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks, Güney, Evren, I. Altinel Kuban, Aras Necati, and Ersoy Cem , EvoWorkshops, p.83–94, (2010)
  4. A comparative analysis of several asymmetric traveling salesman problem formulations, Öncan, Temel, I. Altinel Kuban, and Laporte Gilbert , Computers & Operations Research, Volume 36, p.637–654, (2009)
  5. Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations, Durmaz, Engin, Aras Necati, and I. Altinel Kuban , Computers & Operations Research, Volume 36, p.2139–2148, (2009)
  6. Efficient Lower and Upper Bounds for the Multi-commodity Capacitated Multi-facility Weber Problem with Rectilinear Distances, M. Akyüz, Hakan, Öncan Temel, and I. Altinel Kuban , Logistik Management, (2009)
  7. A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations, I. Altinel, Kuban, Durmaz Engin, Aras Necati, and Özkisacik Kerem Can , European Journal of Operational Research, Volume 198, p.790–799, (2009)
  8. A Variable Neighborhood Search Heuristic for Point Coverage, Sink Location and Data Routing in Wireless Sensor Networks, Güney, Evren, I. Altinel Kuban, Aras Necati, and Ersoy Cem , International Conference on Communication Theory, Reliability, and Quality of Service, (2009)
  9. Solving probabilistic multi-facility Weber problem by vector quantization, Özkısacık, Kerem Can, I. Altinel Kuban, and Aras Necati , OR spectrum, Volume 31, Number 3, p.533–554, (2009)
  10. Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks, I. Altinel, Kuban, Aras Necati, Güney Evren, and Ersoy Cem , Computer Networks, Volume 52, p.2419–2431, (2008)