Necati Aras - RankMe

67 papers A 1B 1C 2Journal 52Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Solving the joint order batching and picker routeing selection problem in warehouses. Int. J. Prod. Res. Ozan Ridvan Aksu, Necati Aras, Temel Öncan
2024	J	`jnl`	Benders decomposition algorithms for minimizing the spread of harmful contagions in networks. Comput. Oper. Res. Kübra Taninmis, Necati Aras, Evren Güney, Markus Sinnl
2023	J	`jnl`	Benders decomposition algorithms for minimizing the spread of harmful contagions in networks. CoRR Kübra Taninmis, Necati Aras, Evren Güney, Markus Sinnl
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`	A trilevel Comput. Oper. Res. Mir Ehsan Hesam Sadati, Deniz Aksen, Necati Aras
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`	Gradual covering location problem with multi-type facilities considering customer preferences. Comput. Ind. Eng. Hande Küçükaydin, 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
2020	J	`jnl`	The r-interdiction selective multi-depot vehicle routing problem. Int. Trans. Oper. Res. Mir Ehsan Hesam Sadati, Deniz Aksen, Necati Aras
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`	SLA-aware optimal resource allocation for service-oriented networks. Future Gener. Comput. Syst. Ahmet Cihat Baktir, Betül Ahat, Necati Aras, Atay Ozgovde, Cem Ersoy
2018	—	`conf`	An Adaptive Large Neighborhood Search Heuristic for Jointly Solving Storage Location Assignment and Picker Routing Problem. OR Necati Aras, Berk Görgülü
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	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`	A bilevel partial interdiction problem with capacitated facilities and demand outsourcing. Comput. Oper. Res. Deniz Aksen, Sema Sengül Akca, Necati Aras
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`	A Bilevel p-median model for the planning and protection of critical facilities. J. Heuristics Deniz Aksen, Necati Aras, Nuray Piyade
2012	C	`conf`	A Branch-and-Price Algorithm for Split-Coloring Problem. CTW R. Mert Yüzsever, Tínaz Ekim, Necati Aras
2012	J	`jnl`	A bilevel fixed charge location model for facilities under imminent attack. Comput. Oper. Res. Deniz Aksen, Necati Aras
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`	A two-echelon stochastic facility location model for humanitarian relief logistics. Optim. Lett. Alper Döyen, Necati Aras, Gülay Barbarosoglu
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	J	`jnl`	Incorporating the threat of terrorist attacks in the design of public service facility networks. Optim. Lett. Serhat Keçici, Necati Aras, Vedat Verter
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
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`	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
2010	J	`jnl`	The budget constrained Central Eur. J. Oper. Res. Deniz Aksen, Nuray Piyade, Necati Aras
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`	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`	Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles. Eur. J. Oper. Res. Necati Aras, Deniz Aksen, Ayse Gönül Tanugur
2007	J	`jnl`	Open vehicle routing problem with driver nodes and time deadlines. J. Oper. Res. Soc. Deniz Aksen, Zeynep Özyurt, Necati Aras
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
2005	—	`conf`	Customer Selection and Profit Maximization in Vehicle Routing Problems. OR Deniz Aksen, Necati Aras
2005	—	`conf`	Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application. OR Zeynep Özyurt, Deniz Aksen, Necati Aras
2005	J	`jnl`	Optimal Prices and Trade-in Rebates for Durable, Remanufacturable Products. Manuf. Serv. Oper. Manag. Saibal Ray, Tamer Boyaci, Necati Aras
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
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
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
1997	—	`conf`	Arbitrary distance function estimation using discrete vector quantization. ICNN B. John Oommen, I. Kuban Altmel, Necati Aras
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