I. Altinel

Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks

I. K. Altinel, Cem Ersoy, I. Kuban Altinel, 2012, Comput. Oper. Res..

Parametric enhancements of the Esau–Williams heuristic for the capacitated minimum spanning tree problem

Temel Öncan, I. Kuban Altinel, T. Öncan, 2009, J. Oper. Res. Soc..

A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2005, J. Oper. Res. Soc..

Minimizing the misinformation spread in social networks

I. K. Altinel, Necati Aras, Evren Güney, 2019, IISE Trans..

Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches

B. John Oommen, I. K. Altinel, I. Kuban Altinel, 2000, Comput. Oper. Res..

Optimal server and service deployment for multi-tier edge cloud computing

Atay Ozgovde, I. K. Altinel, Cem Ersoy, 2021, Comput. Networks.

Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution

I. K. Altinel, Hande Küçükaydin, I. Kuban Altinel, 2011, Eur. J. Oper. Res..

The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem

B. John Oommen, I. K. Altinel, I. Kuban Altinel, 1999, Neural Networks.

A comparative analysis of several asymmetric traveling salesman problem formulations

Temel Öncan, Gilbert Laporte, I. K. Altinel, 2009, Comput. Oper. Res..

Discrete vector quantization for arbitrary distance function estimation

B. John Oommen, I. Kuban Altinel, Necati Aras, 1998, IEEE Trans. Syst. Man Cybern. Part B.

An efficient heuristic for placement, scheduling and routing in wireless sensor networks

Cem Ersoy, I. Kuban Altinel, Yavuz Bogaç Türkogullari, 2008, 2008 23rd International Symposium on Computer and Information Sciences.