Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarNecati Aras
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2017
[j37]Ezgi Karabulut, Necati Aras, I. Kuban Altinel:
Optimal sensor deployment to increase the security of the maximal breach path in border surveillance. European Journal of Operational Research 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. European Journal of Operational Research 254(3): 985-1001 (2016) - [j35]M. 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. IJSNet 20(3): 131-146 (2016) - 2015
- [j34]M. 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. Computers & OR 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. Computers & OR 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]M. 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. Computers & OR 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. European Journal of Operational Research 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. Computers & OR 39(2): 437-448 (2012) - [j27]Deniz Aksen, Necati Aras:
A bilevel fixed charge location model for facilities under imminent attack. Computers & OR 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. Computers & OR 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. Optimization Letters 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. Optimization Letters 6(6): 1123-1145 (2012) - [c9]R. Mert Yüzsever, Tinaz Ekim, Necati Aras:
A Branch-and-Price Algorithm for Split-Coloring Problem. CTW 2012: 249-253 - [c8]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]M. 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. European Journal of Operational Research 208(3): 206-220 (2011) - [j21]Hande Küçükaydin, Necati Aras, I. Kuban Altinel:
A discrete competitive facility location model with variable attractiveness. JORS 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. JORS 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. CEJOR 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. Computer 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. European Journal of Operational Research 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. JORS 61(6): 1000-1012 (2010) - [c7]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 - [c6]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. Computers & OR 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. European Journal of Operational Research 198(3): 790-799 (2009) - [j12]Kerem Can Özkisacik, I. Kuban Altinel, Necati Aras:
Solving probabilistic multi-facility Weber problem by vector quantization. OR Spectrum 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. Computer 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. European Journal of Operational Research 191(3): 1223-1240 (2008) - [j9]Necati Aras, M. Orbay, I. Kuban Altinel:
Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem. JORS 59(1): 64-79 (2008) - 2007
- [j8]Deniz Aksen, Zeynep Özyurt, Necati Aras:
Open vehicle routing problem with driver nodes and time deadlines. JORS 58(9): 1223-1234 (2007) - 2006
- [j7]Necati Aras, Kerem Can Özkisacik, I. Kuban Altinel:
Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps. JORS 57(1): 82-93 (2006) - [c5]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. Manufacturing & Service Operations Management 7(3): 208-228 (2005) - [c4]Deniz Aksen, Necati Aras:
Customer Selection and Profit Maximization in Vehicle Routing Problems. OR 2005: 37-42 - [c3]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) - [c2]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. Computers & OR 27(5): 461-494 (2000) - [c1]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. Systems, Man, and Cybernetics, 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 Journal on Computing 9(4): 439-451 (1997)
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2019-02-16 23:12 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
