default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNecati Aras
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j49]Kübra Taninmis
, Necati Aras, Evren Güney, Markus Sinnl:
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks. Comput. Oper. Res. 167: 106675 (2024)- 2023
- [i3]Kübra Taninmis, Necati Aras, Evren Güney, Markus Sinnl:
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks. CoRR abs/2303.12402 (2023) - 2022
- [j48]Kübra Taninmis, Necati Aras, I. Kuban Altinel:
Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks. Eur. J. Oper. Res. 297(1): 40-52 (2022) - 2021
- [j47]Betül Ahat, Ahmet Cihat Baktir, Necati Aras, I. Kuban Altinel, Atay Özgövde, Cem Ersoy:
Optimal server and service deployment for multi-tier edge cloud computing. Comput. Networks 199: 108393 (2021) - [j46]Zeynep Suvak, I. Kuban Altinel, Necati Aras:
Minimum cost flow problem with conflicts. Networks 78(4): 421-442 (2021) - 2020
- [j45]Hande Küçükaydin, Necati Aras:
Gradual covering location problem with multi-type facilities considering customer preferences. Comput. Ind. Eng. 147: 106577 (2020) - [j44]Mir Ehsan Hesam Sadati, Deniz Aksen, Necati Aras:
A trilevel r-interdiction selective multi-depot vehicle routing problem with depot protection. Comput. Oper. Res. 123: 104996 (2020) - [j43]Zeynep Suvak, I. Kuban Altinel, Necati Aras:
Exact solution algorithms for the maximum flow problem with additional conflict constraints. Eur. J. Oper. Res. 287(2): 410-437 (2020) - [j42]Kübra Taninmis, Necati Aras, I. Kuban Altinel, Evren Güney:
Minimizing the misinformation spread in social networks. IISE Trans. 52(8): 850-863 (2020) - [j41]Mir Ehsan Hesam Sadati, Deniz Aksen, Necati Aras:
The r-interdiction selective multi-depot vehicle routing problem. Int. Trans. Oper. Res. 27(2): 835-866 (2020)
2010 – 2019
- 2019
- [j40]I. Kuban Altinel, Necati Aras, Zeynep Suvak, Z. Caner Taskin:
Minimum cost noncrossing flow problem on layered networks. Discret. Appl. Math. 261: 2-21 (2019) - [j39]Kübra Taninmis, Necati Aras, I. Kuban Altinel:
Influence maximization with deactivation in social networks. Eur. J. Oper. Res. 278(1): 105-119 (2019) - [j38]Ahmet Cihat Baktir, Betül Ahat, Necati Aras, Atay Ozgovde, Cem Ersoy:
SLA-aware optimal resource allocation for service-oriented networks. Future Gener. Comput. Syst. 101: 959-974 (2019) - [c13]Betül Ahat, Necati Aras, I. Kuban Altinel, Ahmet Cihat Baktir, Cem Ersoy:
Optimized Resource Allocation and Task Offload Orchestration for Service-Oriented Networks. OR 2019: 199-205 - [i2]Kübra Taninmis, Necati Aras, I. Kuban Altinel:
Influence Maximization With Deactivation In Social Networks. CoRR abs/1904.08628 (2019) - 2018
- [c12]Necati Aras, Berk Görgülü:
An Adaptive Large Neighborhood Search Heuristic for Jointly Solving Storage Location Assignment and Picker Routing Problem. OR 2018: 301-307 - 2017
- [j37]Ezgi Karabulut, Necati Aras, I. Kuban Altinel:
Optimal sensor deployment to increase the security of the maximal breach path in border surveillance. Eur. J. Oper. Res. 259(1): 19-36 (2017) - 2016
- [j36]Yavuz Bogaç Türkogullari, Z. Caner Taskin, Necati Aras, I. Kuban Altinel:
Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals. Eur. J. Oper. Res. 254(3): 985-1001 (2016) - [j35]Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras, Cem Ersoy:
Wireless sensor network design by lifetime maximisation: an empirical evaluation of integrating major design issues and sink mobility. Int. J. Sens. Networks 20(3): 131-146 (2016) - 2015
- [j34]Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras:
Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks. Comput. Oper. Res. 59: 132-143 (2015) - [j33]Burak Kocuk, I. Kuban Altinel, Necati Aras:
Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction. Comput. Oper. Res. 64: 139-158 (2015) - [i1]Yavuz Bogaç Türkogullari, I. Kuban Altinel, Z. Caner Taskin, Zeynep Suvak, Necati Aras:
Minimum Cost Noncrossing Flow Problem on a Layered Network. CTW 2015: 129-132 - 2014
- [j32]Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras, Cem Ersoy:
Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility. Ad Hoc Networks 17: 18-36 (2014) - [j31]Deniz Aksen, Sema Sengül Akca, Necati Aras:
A bilevel partial interdiction problem with capacitated facilities and demand outsourcing. Comput. Oper. Res. 41: 346-358 (2014) - [j30]Yavuz Bogaç Türkogullari, Z. Caner Taskin, Necati Aras, I. Kuban Altinel:
Optimal berth allocation and time-invariant quay crane assignment in container terminals. Eur. J. Oper. Res. 235(1): 88-101 (2014) - 2013
- [j29]Deniz Aksen, Necati Aras, Nuray Piyade:
A Bilevel p-median model for the planning and protection of critical facilities. J. Heuristics 19(2): 373-398 (2013) - 2012
- [j28]Hande Küçükaydin, Necati Aras, I. Kuban Altinel:
A leader-follower game in competitive facility location. Comput. Oper. Res. 39(2): 437-448 (2012) - [j27]Deniz Aksen, Necati Aras:
A bilevel fixed charge location model for facilities under imminent attack. Comput. Oper. Res. 39(7): 1364-1381 (2012) - [j26]Evren Güney, Necati Aras, I. Kuban Altinel, Cem Ersoy:
Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks. Comput. Oper. Res. 39(7): 1530-1539 (2012) - [j25]Serhat Keçici, Necati Aras, Vedat Verter:
Incorporating the threat of terrorist attacks in the design of public service facility networks. Optim. Lett. 6(6): 1101-1121 (2012) - [j24]Alper Döyen, Necati Aras, Gülay Barbarosoglu:
A two-echelon stochastic facility location model for humanitarian relief logistics. Optim. Lett. 6(6): 1123-1145 (2012) - [c11]R. Mert Yüzsever, Tínaz Ekim, Necati Aras:
A Branch-and-Price Algorithm for Split-Coloring Problem. CTW 2012: 249-253 - [c10]Necati Aras, Yavuz Bogaç Türkogullari, Z. Caner Taskin, I. Kuban Altinel:
Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals. OR 2012: 101-107 - 2011
- [j23]Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras, Cem Ersoy:
Lifetime Maximization in Wireless Sensor Networks Using a Mobile Sink with Nonzero Traveling Time. Comput. J. 54(12): 1987-1999 (2011) - [j22]Hande Küçükaydin, Necati Aras, I. Kuban Altinel:
Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution. Eur. J. Oper. Res. 208(3): 206-220 (2011) - [j21]Hande Küçükaydin, Necati Aras, I. Kuban Altinel:
A discrete competitive facility location model with variable attractiveness. J. Oper. Res. Soc. 62(9): 1726-1741 (2011) - [j20]I. Kuban Altinel, Necati Aras, Kerem Can Özkisacik:
Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem. J. Oper. Res. Soc. 62(10): 1813-1826 (2011) - 2010
- [j19]Yavuz Bogaç Türkogullari, Necati Aras, I. Kuban Altinel, Cem Ersoy:
An efficient heuristic for placement, scheduling and routing in wireless sensor networks. Ad Hoc Networks 8(6): 654-667 (2010) - [j18]Deniz Aksen, Nuray Piyade, Necati Aras:
The budget constrained r-interdiction median problem with capacity expansion. Central Eur. J. Oper. Res. 18(3): 269-291 (2010) - [j17]Evren Güney, Necati Aras, I. Kuban Altinel, Cem Ersoy:
Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks. Comput. Networks 54(11): 1805-1822 (2010) - [j16]Yavuz Bogaç Türkogullari, Necati Aras, I. Kuban Altinel, Cem Ersoy:
A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks. Eur. J. Oper. Res. 207(2): 1014-1026 (2010) - [j15]Yavuz Bogaç Türkogullari, Necati Aras, I. Kuban Altinel, Cem Ersoy:
Optimal placement, scheduling, and routing to maximize lifetime in sensor networks. J. Oper. Res. Soc. 61(6): 1000-1012 (2010) - [c9]Evren Güney, I. Kuban Altinel, Necati Aras, Cem Ersoy:
A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks. EvoCOP 2010: 83-94 - [c8]Hande Küçükaydin, Necati Aras, I. Kuban Altinel:
A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model. Hybrid Metaheuristics 2010: 31-45
2000 – 2009
- 2009
- [j14]Engin Durmaz, Necati Aras, I. Kuban Altinel:
Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations. Comput. Oper. Res. 36(7): 2139-2148 (2009) - [j13]I. Kuban Altinel, Engin Durmaz, Necati Aras, Kerem Can Özkisacik:
A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations. Eur. J. Oper. Res. 198(3): 790-799 (2009) - [j12]Kerem Can Özkisacik, I. Kuban Altinel, Necati Aras:
Solving probabilistic multi-facility Weber problem by vector quantization. OR Spectr. 31(3): 533-554 (2009) - 2008
- [j11]I. Kuban Altinel, Necati Aras, Evren Güney, Cem Ersoy:
Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks. Comput. Networks 52(12): 2419-2431 (2008) - [j10]Necati Aras, Deniz Aksen, Ayse Gönül Tanugur:
Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles. Eur. J. Oper. Res. 191(3): 1223-1240 (2008) - [j9]Necati Aras, M. Orbay, I. Kuban Altinel:
Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem. J. Oper. Res. Soc. 59(1): 64-79 (2008) - 2007
- [j8]Deniz Aksen, Zeynep Özyurt, Necati Aras:
Open vehicle routing problem with driver nodes and time deadlines. J. Oper. Res. Soc. 58(9): 1223-1234 (2007) - [p1]Necati Aras, Sadettin Yumusak, I. Kuban Altinel:
Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms. Metaheuristics 2007: 91-112 - 2006
- [j7]Necati Aras, Kerem Can Özkisacik, I. Kuban Altinel:
Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps. J. Oper. Res. Soc. 57(1): 82-93 (2006) - [c7]I. Kuban Altinel, Necati Aras, Evren Güney, Cem Ersoy:
Effective coverage in sensor networks: Binary integer programming formulations and heuristics. ICC 2006: 4014-4019 - 2005
- [j6]Saibal Ray, Tamer Boyaci, Necati Aras:
Optimal Prices and Trade-in Rebates for Durable, Remanufacturable Products. Manuf. Serv. Oper. Manag. 7(3): 208-228 (2005) - [c6]Deniz Aksen, Necati Aras:
Customer Selection and Profit Maximization in Vehicle Routing Problems. OR 2005: 37-42 - [c5]Zeynep Özyurt, Deniz Aksen, Necati Aras:
Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application. OR 2005: 73-78 - 2003
- [j5]Necati Aras, I. Kuban Altinel, B. John Oommen:
A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE. IEEE Trans. Neural Networks 14(4): 869-890 (2003) - [c4]I. Kuban Altinel, Necati Aras, B. John Oommen:
A self-organizing method for map reconstruction. NNSP 2003: 677-687 - 2000
- [j4]I. Kuban Altinel, Necati Aras, B. John Oommen:
Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches. Comput. Oper. Res. 27(5): 461-494 (2000) - [c3]Necati Aras, I. Kuban Altinel, B. John Oommen:
A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE. ECAI 2000: 261-265
1990 – 1999
- 1999
- [j3]Necati Aras, B. John Oommen, I. Kuban Altinel:
The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem. Neural Networks 12(9): 1273-1284 (1999) - 1998
- [j2]B. John Oommen, I. Kuban Altinel, Necati Aras:
Discrete vector quantization for arbitrary distance function estimation. IEEE Trans. Syst. Man Cybern. Part B 28(4): 496-510 (1998) - 1997
- [j1]I. Kuban Altinel, B. John Oommen, Necati Aras:
Vector Quantization for Arbitrary Distance Function Estimation. INFORMS J. Comput. 9(4): 439-451 (1997) - [c2]B. John Oommen, I. Kuban Altmel, Necati Aras:
Arbitrary distance function estimation using discrete vector quantization. ICNN 1997: 1272-1277 - 1995
- [c1]B. John Oommen, I. Kuban Altinel, Necati Aras:
Arbitrary distance function estimation using vector quantization. ICNN 1995: 3062-3067
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
