I. Kuban Altinel

75 papers A 1B 1C 2Journal 62Unranked 8

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints. Eur. J. Oper. Res. Bahadir Pamuk, Temel Öncan, I. Kuban Altinel
2023	J	`jnl`	Maximum weight perfect matching problem with additional disjunctive conflict constraints. Networks M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan
2022	J	`jnl`	Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks. Eur. J. Oper. Res. Kübra Taninmis, Necati Aras, I. Kuban Altinel
2021	J	`jnl`	Minimum cost flow problem with conflicts. Networks Zeynep Suvak, I. Kuban Altinel, Necati Aras
2021	J	`jnl`	Optimal server and service deployment for multi-tier edge cloud computing. Comput. Networks Betül Ahat, Ahmet Cihat Baktir, Necati Aras, I. Kuban Altinel, Atay Özgövde, Cem Ersoy
2020	J	`jnl`	Exact solution algorithms for the maximum flow problem with additional conflict constraints. Eur. J. Oper. Res. Zeynep Suvak, I. Kuban Altinel, Necati Aras
2020	J	`jnl`	Minimizing the misinformation spread in social networks. IISE Trans. Kübra Taninmis, Necati Aras, I. Kuban Altinel, Evren Güney
2019	C	`conf`	A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs. INOC Temel Öncan, M. Hakan Akyüz, I. Kuban Altinel
2019	J	`jnl`	Assignment problem with conflicts. Comput. Oper. Res. Temel Öncan, Zeynep Suvak, M. Hakan Akyüz, I. Kuban Altinel
2019	J	`jnl`	Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem. Ann. Oper. Res. M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel
2019	J	`jnl`	Influence Maximization With Deactivation In Social Networks. CoRR Kübra Taninmis, Necati Aras, I. Kuban Altinel
2019	J	`jnl`	Influence maximization with deactivation in social networks. Eur. J. Oper. Res. Kübra Taninmis, Necati Aras, I. Kuban Altinel
2019	J	`jnl`	Minimum cost noncrossing flow problem on layered networks. Discret. Appl. Math. I. Kuban Altinel, Necati Aras, Zeynep Suvak, Z. Caner Taskin
2019	—	`conf`	Optimized Resource Allocation and Task Offload Orchestration for Service-Oriented Networks. OR Betül Ahat, Necati Aras, I. Kuban Altinel, Ahmet Cihat Baktir, Cem Ersoy
2019	J	`jnl`	Rectangle Blanket Problem: Binary integer linear programming formulation and solution algorithms. CoRR Baris Evrim Demiröz, I. Kuban Altinel, Lale Akarun
2019	J	`jnl`	Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms. Eur. J. Oper. Res. Baris Evrim Demiröz, I. Kuban Altinel, Lale Akarun
2019	J	`jnl`	The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT). Eur. J. Oper. Res. Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel
2019	J	`jnl`	Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT). Comput. Oper. Res. Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel
2018	J	`jnl`	A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints. Electron. Notes Discret. Math. Temel Öncan, I. Kuban Altinel
2017	J	`jnl`	Optimal sensor deployment to increase the security of the maximal breach path in border surveillance. Eur. J. Oper. Res. Ezgi Karabulut, Necati Aras, I. Kuban Altinel
2016	—	`conf`	Mathematical Models for Optimal Volumetric Modulated Arc Therapy (VMAT) Treatment Planning. CENTERIS/ProjMAN/HCist Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel
2016	J	`jnl`	Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals. Eur. J. Oper. Res. Yavuz Bogaç Türkogullari, Z. Caner Taskin, Necati Aras, I. Kuban Altinel
2016	J	`jnl`	Wireless sensor network design by lifetime maximisation: an empirical evaluation of integrating major design issues and sink mobility. Int. J. Sens. Networks Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras, Cem Ersoy
2015	J	`jnl`	Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction. Comput. Oper. Res. Burak Kocuk, I. Kuban Altinel, Necati Aras
2015	J	`jnl`	Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks. Comput. Oper. Res. Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras
2015	C	`conf`	Minimum Cost Noncrossing Flow Problem on a Layered Network. CTW Yavuz Bogaç Türkogullari, I. Kuban Altinel, Z. Caner Taskin, Zeynep Suvak, Necati Aras
2014	J	`jnl`	Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem. Ann. Oper. Res. M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan
2014	J	`jnl`	Optimal berth allocation and time-invariant quay crane assignment in container terminals. Eur. J. Oper. Res. Yavuz Bogaç Türkogullari, Z. Caner Taskin, Necati Aras, I. Kuban Altinel
2014	J	`jnl`	Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility. Ad Hoc Networks Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras, Cem Ersoy
2013	J	`jnl`	Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems. Comput. Oper. Res. M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel
2012	J	`jnl`	A leader-follower game in competitive facility location. Comput. Oper. Res. Hande Küçükaydin, Necati Aras, I. Kuban Altinel
2012	J	`jnl`	An evolutionary approach for tuning parametric Esau and Williams heuristics. J. Oper. Res. Soc. Maria Battarra, Temel Öncan, I. Kuban Altinel, Bruce L. Golden, Daniele Vigo, E. Phillips
2012	J	`jnl`	Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem. Comput. Oper. Res. M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel
2012	J	`jnl`	Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks. Comput. Oper. Res. Evren Güney, Necati Aras, I. Kuban Altinel, Cem Ersoy
2012	—	`conf`	Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals. OR Necati Aras, Yavuz Bogaç Türkogullari, Z. Caner Taskin, I. Kuban Altinel
2012	J	`jnl`	Solving the multi-commodity capacitated multi-facility Weber problem using Lagrangean relaxation and a subgradient-like algorithm. J. Oper. Res. Soc. M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel
2011	J	`jnl`	A discrete competitive facility location model with variable attractiveness. J. Oper. Res. Soc. Hande Küçükaydin, Necati Aras, I. Kuban Altinel
2011	J	`jnl`	Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution. Eur. J. Oper. Res. Hande Küçükaydin, Necati Aras, I. Kuban Altinel
2011	J	`jnl`	Lifetime Maximization in Wireless Sensor Networks Using a Mobile Sink with Nonzero Traveling Time. Comput. J. Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras, Cem Ersoy
2011	J	`jnl`	Mission-Based Component Testing for Series Systems. Ann. Oper. Res. I. Kuban Altinel, Bora Çekyay, Orhan Feyzioglu, Muhammed Emre Keskin, Süleyman Özekici
2011	J	`jnl`	Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem. J. Oper. Res. Soc. I. Kuban Altinel, Necati Aras, Kerem Can Özkisacik
2010	—	`conf`	A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model. Hybrid Metaheuristics Hande Küçükaydin, Necati Aras, I. Kuban Altinel
2010	B	`conf`	A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks. EvoCOP Evren Güney, I. Kuban Altinel, Necati Aras, Cem Ersoy
2010	J	`jnl`	A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks. Eur. J. Oper. Res. Yavuz Bogaç Türkogullari, Necati Aras, I. Kuban Altinel, Cem Ersoy
2010	J	`jnl`	An efficient heuristic for placement, scheduling and routing in wireless sensor networks. Ad Hoc Networks Yavuz Bogaç Türkogullari, Necati Aras, I. Kuban Altinel, Cem Ersoy
2010	J	`jnl`	Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks. Comput. Networks Evren Güney, Necati Aras, I. Kuban Altinel, Cem Ersoy
2010	J	`jnl`	Optimal placement, scheduling, and routing to maximize lifetime in sensor networks. J. Oper. Res. Soc. Yavuz Bogaç Türkogullari, Necati Aras, I. Kuban Altinel, Cem Ersoy
2009	J	`jnl`	A comparative analysis of several asymmetric traveling salesman problem formulations. Comput. Oper. Res. Temel Öncan, I. Kuban Altinel, Gilbert Laporte
2009	J	`jnl`	A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations. Eur. J. Oper. Res. I. Kuban Altinel, Engin Durmaz, Necati Aras, Kerem Can Özkisacik
2009	J	`jnl`	Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations. Comput. Oper. Res. Engin Durmaz, Necati Aras, I. Kuban Altinel
2009	J	`jnl`	Parametric enhancements of the Esau-Williams heuristic for the capacitated minimum spanning tree problem. J. Oper. Res. Soc. Temel Öncan, I. Kuban Altinel
2009	J	`jnl`	Solving probabilistic multi-facility Weber problem by vector quantization. OR Spectr. Kerem Can Özkisacik, I. Kuban Altinel, Necati Aras
2008	J	`jnl`	Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks. Comput. Networks I. Kuban Altinel, Necati Aras, Evren Güney, Cem Ersoy
2008	J	`jnl`	Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem. J. Oper. Res. Soc. Necati Aras, M. Orbay, I. Kuban Altinel
2008	J	`jnl`	Exact solution procedures for the balanced unidirectional cyclic layout problem. Eur. J. Oper. Res. Temel Öncan, I. Kuban Altinel
2008	J	`jnl`	Optimum component test plans for phased-mission systems. Eur. J. Oper. Res. Orhan Feyzioglu, I. Kuban Altinel, Süleyman Özekici
2007	—	`ch.`	Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms. Metaheuristics Necati Aras, Sadettin Yumusak, I. Kuban Altinel
2006	—	`conf`	Effective coverage in sensor networks: Binary integer programming formulations and heuristics. ICC I. Kuban Altinel, Necati Aras, Evren Güney, Cem Ersoy
2006	J	`jnl`	Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps. J. Oper. Res. Soc. Necati Aras, Kerem Can Özkisacik, I. Kuban Altinel
2006	J	`jnl`	The design of optimum component test plans for system reliability. Comput. Stat. Data Anal. Orhan Feyzioglu, I. Kuban Altinel, Süleyman Özekici
2005	J	`jnl`	A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. J. Oper. Res. Soc. I. Kuban Altinel, Temel Öncan
2003	J	`jnl`	A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE. IEEE Trans. Neural Networks Necati Aras, I. Kuban Altinel, B. John Oommen
2003	—	`conf`	A self-organizing method for map reconstruction. NNSP I. Kuban Altinel, Necati Aras, B. John Oommen
2002	J	`jnl`	A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries. Eur. J. Oper. Res. Murat Draman, I. Kuban Altinel, Nijaz Bajgoric, Ali Tamer Ünal, Burak Birgören
2002	J	`jnl`	Component testing of a series system in a random mission. Reliab. Eng. Syst. Saf. I. Kuban Altinel, Süleyman Özekici, Orhan Feyzioglu
2002	J	`jnl`	Some aspects of using CASE tools in a Fusion-based application development project for production optimization. Ind. Manag. Data Syst. Nijaz Bajgoric, I. Kuban Altinel, Murat Draman, Ali Tamer Ünal
2001	J	`jnl`	Component testing of repairable systems in multistage missions. J. Oper. Res. Soc. I. Kuban Altinel, Süleyman Özekici, Orhan Feyzioglu
2000	A	`conf`	A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIES ECAI Necati Aras, I. Kuban Altinel, B. John Oommen
2000	J	`jnl`	Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches. Comput. Oper. Res. I. Kuban Altinel, Necati Aras, B. John Oommen
1999	J	`jnl`	The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem. Neural Networks Necati Aras, B. John Oommen, I. Kuban Altinel
1999	—	`conf`	Using Paradigm Plus CASE Tool in a Fusion-Based Application Development Project. TOOLS (31) Nijaz Bajgoric, I. Kuban Altinel, Murat Draman, Ali Tamer Ünal
1998	J	`jnl`	Discrete vector quantization for arbitrary distance function estimation. IEEE Trans. Syst. Man Cybern. Part B B. John Oommen, I. Kuban Altinel, Necati Aras
1998	J	`jnl`	Optimum component test plans for systems with dependent components. Eur. J. Oper. Res. I. Kuban Altinel, Süleyman Özekici
1997	J	`jnl`	Vector Quantization for Arbitrary Distance Function Estimation. INFORMS J. Comput. I. Kuban Altinel, B. John Oommen, Necati Aras
1995	—	`conf`	Arbitrary distance function estimation using vector quantization. ICNN B. John Oommen, I. Kuban Altinel, Necati Aras