 | 2009 |
|---|
| 10 |       | 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) |
| 9 | | 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) |
| 2008 |
|---|
| 8 | | 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) |
| 7 | | 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) |
| 2005 |
|---|
| 6 | | Deniz Aksen,
Necati Aras:
Customer Selection and Profit Maximization in Vehicle Routing Problems.
OR 2005: 37-42 |
| 5 | | Zeynep Özyurt,
Deniz Aksen,
Necati Aras:
Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application.
OR 2005: 73-78 |
| 2000 |
|---|
| 4 |  | Necati Aras,
I. Kuban Altinel,
B. John Oommen:
A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE.
ECAI 2000: 261-265 |
| 1999 |
|---|
| 3 | | 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 |
|---|
| 2 | | B. John Oommen,
I. Kuban Altinel,
Necati Aras:
Discrete vector quantization for arbitrary distance function estimation.
IEEE Transactions on Systems, Man, and Cybernetics, Part B 28(4): 496-510 (1998) |
| 1997 |
|---|
| 1 | | I. Kuban Altinel,
B. John Oommen,
Necati Aras:
Vector Quantization for Arbitrary Distance Function Estimation.
INFORMS Journal on Computing 9(4): 439-451 (1997) |
