İ. 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.
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. Minimizing the misinformation spread in social networks, Tanınmış, Kübra, Aras Necati, I. Altinel Kuban, and Güney Evren , IISE Transactions, Volume 52, p.850-863, (2020)
  2. Exact solution algorithms for the maximum flow problem with additional conflict constraints, Şuvak, Zeynep, I. Altinel Kuban, and Aras Necati , European Journal of Operational Research, Volume 287, p.410-437, (2020)
  3. Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT), Dursun, Pınar, Taşkın Z C., and I. Altinel Kuban , Computers & Operations Research, Volume 110, p.1-17, (2019)
  4. The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT), Dursun, Pınar, Taşkın Z C., and I. Altinel Kuban , European Journal of Operational Research, Volume 272, p.372-388, (2019)
  5. A column generation heuristic for VMAT planning with adaptive CVaR constraints, Dursun, Pınar, Taşkın Z C., I. Altinel Kuban, Bilge Hatice, Kesen Nazmiye Dönmez, Okutan Murat, and Oral Ethem Nezih , Physics in Medicine {&} Biology, oct, Volume 64, p.205024, (2019)
  6. Minimum cost noncrossing flow problem on layered networks, I. Altinel, Kuban, Aras Necati, Şuvak Zeynep, and Taşkın Z C. , Discrete Applied Mathematics, Volume 261, p.2-21, (2019)
  7. Influence maximization with deactivation in social networks, Tanınmış, Kübra, Aras Necati, and I. Altinel Kuban , European Journal of Operational Research, Volume 278, p.105-119, (2019)
  8. Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms, Demiröz, Barış Evrim, I. Altinel Kuban, and Akarun Lale , European Journal of Operational Research, Volume 277, p.62-83, (2019)
  9. Assignment problem with conflicts, Öncan, Temel, Şuvak Zeynep, M. Akyüz Hakan, and I. Altinel Kuban , Computers & Operations Research, Volume 111, p.214-229, (2019)
  10. Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem, M Akyüz, Hakan, Öncan Temel, and I. Altinel Kuban , Annals of Operations Research, Volume 279, p.1–42, (2019)