I. Kuban Altinel

According to our database, I. Kuban Altinel authored at least 72 papers between 1995 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Maximum weight perfect matching problem with additional disjunctive conflict constraints.

M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan

Networks, June, 2023

2022

Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks.

Kübra Taninmis, Necati Aras, I. Kuban Altinel

Eur. J. Oper. Res., 2022

2021

Minimum cost flow problem with conflicts.

Zeynep Suvak, I. Kuban Altinel, Necati Aras

Networks, 2021

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

Betül Ahat, Ahmet Cihat Baktir, Necati Aras, I. Kuban Altinel, Atay Özgövde, Cem Ersoy

Comput. Networks, 2021

2020

Minimizing the misinformation spread in social networks.

Kübra Taninmis, Necati Aras, I. Kuban Altinel, Evren Güney

IISE Trans., 2020

Exact solution algorithms for the maximum flow problem with additional conflict constraints.

Zeynep Suvak, I. Kuban Altinel, Necati Aras

Eur. J. Oper. Res., 2020

2019

Influence maximization with deactivation in social networks.

Kübra Taninmis, Necati Aras, I. Kuban Altinel

Eur. J. Oper. Res., 2019

The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT).

Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel

Eur. J. Oper. Res., 2019

Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms.

Baris Evrim Demiröz, I. Kuban Altinel, Lale Akarun

Eur. J. Oper. Res., 2019

Minimum cost noncrossing flow problem on layered networks.

I. Kuban Altinel, Necati Aras, Zeynep Suvak, Z. Caner Taskin

Discret. Appl. Math., 2019

Assignment problem with conflicts.

Temel Öncan, Zeynep Suvak, M. Hakan Akyüz, I. Kuban Altinel

Comput. Oper. Res., 2019

Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT).

Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel

Comput. Oper. Res., 2019

Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem.

M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel

Ann. Oper. Res., 2019

Optimized Resource Allocation and Task Offload Orchestration for Service-Oriented Networks.

Betül Ahat, Necati Aras, I. Kuban Altinel, Ahmet Cihat Baktir, Cem Ersoy

Proceedings of the Operations Research Proceedings 2019, 2019

A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs.

Temel Öncan, M. Hakan Akyüz, I. Kuban Altinel

Proceedings of the 9th International Network Optimization Conference, 2019

2018

A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints.

Temel Öncan, I. Kuban Altinel

Electron. Notes Discret. Math., 2018

2017

Optimal sensor deployment to increase the security of the maximal breach path in border surveillance.

Ezgi Karabulut, Necati Aras, I. Kuban Altinel

Eur. J. Oper. Res., 2017

2016

Wireless sensor network design by lifetime maximisation: an empirical evaluation of integrating major design issues and sink mobility.

Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras, Cem Ersoy

Int. J. Sens. Networks, 2016

Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals.

Yavuz Bogaç Türkogullari, Z. Caner Taskin, Necati Aras, I. Kuban Altinel

Eur. J. Oper. Res., 2016

Mathematical Models for Optimal Volumetric Modulated Arc Therapy (VMAT) Treatment Planning.

Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel

Proceedings of the International Conference on ENTERprise Information Systems/International Conference on Project MANagement/International Conference on Health and Social Care Information Systems and Technologies, 2016

2015

Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction.

Burak Kocuk, I. Kuban Altinel, Necati Aras

Comput. Oper. Res., 2015

Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks.

Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras

Comput. Oper. Res., 2015

Minimum Cost Noncrossing Flow Problem on a Layered Network.

Yavuz Bogaç Türkogullari, I. Kuban Altinel, Z. Caner Taskin, Zeynep Suvak, Necati Aras

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Optimal berth allocation and time-invariant quay crane assignment in container terminals.

Yavuz Bogaç Türkogullari, Z. Caner Taskin, Necati Aras, I. Kuban Altinel

Eur. J. Oper. Res., 2014

Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem.

M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan

Ann. Oper. Res., 2014

Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility.

Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras, Cem Ersoy

Ad Hoc Networks, 2014

2013

Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems.

M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel

Comput. Oper. Res., 2013

2012

An evolutionary approach for tuning parametric Esau and Williams heuristics.

Maria Battarra, Temel Öncan, I. Kuban Altinel, Bruce L. Golden, Daniele Vigo, E. Phillips

J. Oper. Res. Soc., 2012

Solving the multi-commodity capacitated multi-facility Weber problem using Lagrangean relaxation and a subgradient-like algorithm.

M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel

J. Oper. Res. Soc., 2012

A leader-follower game in competitive facility location.

Hande Küçükaydin, Necati Aras, I. Kuban Altinel

Comput. Oper. Res., 2012

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

Evren Güney, Necati Aras, I. Kuban Altinel, Cem Ersoy

Comput. Oper. Res., 2012

Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem.

M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel

Comput. Oper. Res., 2012

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals.

Necati Aras, Yavuz Bogaç Türkogullari, Z. Caner Taskin, I. Kuban Altinel

Proceedings of the Operations Research Proceedings 2012, 2012

2011

A discrete competitive facility location model with variable attractiveness.

Hande Küçükaydin, Necati Aras, I. Kuban Altinel

J. Oper. Res. Soc., 2011

Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem.

I. Kuban Altinel, Necati Aras, Kerem Can Özkisacik

J. Oper. Res. Soc., 2011

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

Hande Küçükaydin, Necati Aras, I. Kuban Altinel

Eur. J. Oper. Res., 2011

Lifetime Maximization in Wireless Sensor Networks Using a Mobile Sink with Nonzero Traveling Time.

Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras, Cem Ersoy

Comput. J., 2011

Mission-Based Component Testing for Series Systems.

I. Kuban Altinel, Bora Çekyay, Orhan Feyzioglu, Muhammed Emre Keskin, Süleyman Özekici

Ann. Oper. Res., 2011

2010

Optimal placement, scheduling, and routing to maximize lifetime in sensor networks.

Yavuz Bogaç Türkogullari, Necati Aras, I. Kuban Altinel, Cem Ersoy

J. Oper. Res. Soc., 2010

A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks.

Yavuz Bogaç Türkogullari, Necati Aras, I. Kuban Altinel, Cem Ersoy

Eur. J. Oper. Res., 2010

Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks.

Evren Güney, Necati Aras, I. Kuban Altinel, Cem Ersoy

Comput. Networks, 2010

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

Yavuz Bogaç Türkogullari, Necati Aras, I. Kuban Altinel, Cem Ersoy

Ad Hoc Networks, 2010

A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model.

Hande Küçükaydin, Necati Aras, I. Kuban Altinel

Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks.

Evren Güney, I. Kuban Altinel, Necati Aras, Cem Ersoy

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2010

2009

Solving probabilistic multi-facility Weber problem by vector quantization.

Kerem Can Özkisacik, I. Kuban Altinel, Necati Aras

OR Spectr., 2009

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

Temel Öncan, I. Kuban Altinel

J. Oper. Res. Soc., 2009

A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations.

I. Kuban Altinel, Engin Durmaz, Necati Aras, Kerem Can Özkisacik

Eur. J. Oper. Res., 2009

A comparative analysis of several asymmetric traveling salesman problem formulations.

Temel Öncan, I. Kuban Altinel, Gilbert Laporte

Comput. Oper. Res., 2009

Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations.

Engin Durmaz, Necati Aras, I. Kuban Altinel

Comput. Oper. Res., 2009

2008

Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem.

Necati Aras, M. Orbay, I. Kuban Altinel

J. Oper. Res. Soc., 2008

Exact solution procedures for the balanced unidirectional cyclic layout problem.

Temel Öncan, I. Kuban Altinel

Eur. J. Oper. Res., 2008

Optimum component test plans for phased-mission systems.

Orhan Feyzioglu, I. Kuban Altinel, Süleyman Özekici

Eur. J. Oper. Res., 2008

Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks.

I. Kuban Altinel, Necati Aras, Evren Güney, Cem Ersoy

Comput. Networks, 2008

2007

Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms.

Necati Aras, Sadettin Yumusak, I. Kuban Altinel

Proceedings of the Metaheuristics, 2007

2006

Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps.

Necati Aras, Kerem Can Özkisacik, I. Kuban Altinel

J. Oper. Res. Soc., 2006

The design of optimum component test plans for system reliability.

Orhan Feyzioglu, I. Kuban Altinel, Süleyman Özekici

Comput. Stat. Data Anal., 2006

Effective coverage in sensor networks: Binary integer programming formulations and heuristics.

I. Kuban Altinel, Necati Aras, Evren Güney, Cem Ersoy

Proceedings of IEEE International Conference on Communications, 2006

2005

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

I. Kuban Altinel, Temel Öncan

J. Oper. Res. Soc., 2005

2003

A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE.

Necati Aras, I. Kuban Altinel, B. John Oommen

IEEE Trans. Neural Networks, 2003

A self-organizing method for map reconstruction.

I. Kuban Altinel, Necati Aras, B. John Oommen

Proceedings of the NNSP 2003, 2003

2002

Component testing of a series system in a random mission.

I. Kuban Altinel, Süleyman Özekici, Orhan Feyzioglu

Reliab. Eng. Syst. Saf., 2002

Some aspects of using CASE tools in a Fusion-based application development project for production optimization.

Nijaz Bajgoric, I. Kuban Altinel, Murat Draman, Ali Tamer Ünal

Ind. Manag. Data Syst., 2002

A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries.

Murat Draman, I. Kuban Altinel, Nijaz Bajgoric, Ali Tamer Ünal, Burak Birgören

Eur. J. Oper. Res., 2002

2001

Component testing of repairable systems in multistage missions.

I. Kuban Altinel, Süleyman Özekici, Orhan Feyzioglu

J. Oper. Res. Soc., 2001

2000

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

I. Kuban Altinel, Necati Aras, B. John Oommen

Comput. Oper. Res., 2000

A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIES_DECOMPOSE.

Necati Aras, I. Kuban Altinel, B. John Oommen

Proceedings of the ECAI 2000, 2000

1999

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

Necati Aras, B. John Oommen, I. Kuban Altinel

Neural Networks, 1999

Using Paradigm Plus CASE Tool in a Fusion-Based Application Development Project.

Nijaz Bajgoric, I. Kuban Altinel, Murat Draman, Ali Tamer Ünal

Proceedings of the TOOLS 1999: 31st International Conference on Technology of Object-Oriented Languages and Systems, 1999

1998

Discrete vector quantization for arbitrary distance function estimation.

B. John Oommen, I. Kuban Altinel, Necati Aras

IEEE Trans. Syst. Man Cybern. Part B, 1998

Optimum component test plans for systems with dependent components.

I. Kuban Altinel, Süleyman Özekici

Eur. J. Oper. Res., 1998

1997

Vector Quantization for Arbitrary Distance Function Estimation.

I. Kuban Altinel, B. John Oommen, Necati Aras

INFORMS J. Comput., 1997

1995

Arbitrary distance function estimation using vector quantization.

B. John Oommen, I. Kuban Altinel, Necati Aras

Proceedings of International Conference on Neural Networks (ICNN'95), Perth, WA, Australia, November 27, 1995