Necati Aras

Orcid: 0000-0002-1485-730X

According to our database1, Necati Aras authored at least 64 papers between 1995 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks.
CoRR, 2023

2022
Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks.
Eur. J. Oper. Res., 2022

2021
Minimum cost flow problem with conflicts.
Networks, 2021

Optimal server and service deployment for multi-tier edge cloud computing.
Comput. Networks, 2021

2020
The r-interdiction selective multi-depot vehicle routing problem.
Int. Trans. Oper. Res., 2020

Minimizing the misinformation spread in social networks.
IISE Trans., 2020

Exact solution algorithms for the maximum flow problem with additional conflict constraints.
Eur. J. Oper. Res., 2020

A trilevel <i>r</i>-interdiction selective multi-depot vehicle routing problem with depot protection.
Comput. Oper. Res., 2020

Gradual covering location problem with multi-type facilities considering customer preferences.
Comput. Ind. Eng., 2020

2019
SLA-aware optimal resource allocation for service-oriented networks.
Future Gener. Comput. Syst., 2019

Influence maximization with deactivation in social networks.
Eur. J. Oper. Res., 2019

Minimum cost noncrossing flow problem on layered networks.
Discret. Appl. Math., 2019

Optimized Resource Allocation and Task Offload Orchestration for Service-Oriented Networks.
Proceedings of the Operations Research Proceedings 2019, 2019

2018
An Adaptive Large Neighborhood Search Heuristic for Jointly Solving Storage Location Assignment and Picker Routing Problem.
Proceedings of the Operations Research Proceedings 2018, 2018

2017
Optimal sensor deployment to increase the security of the maximal breach path in border surveillance.
Eur. J. Oper. Res., 2017

2016
Wireless sensor network design by lifetime maximisation: an empirical evaluation of integrating major design issues and sink mobility.
Int. J. Sens. Networks, 2016

Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals.
Eur. J. Oper. Res., 2016

2015
Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction.
Comput. Oper. Res., 2015

Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks.
Comput. Oper. Res., 2015

Minimum Cost Noncrossing Flow Problem on a Layered Network.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Optimal berth allocation and time-invariant quay crane assignment in container terminals.
Eur. J. Oper. Res., 2014

A bilevel partial interdiction problem with capacitated facilities and demand outsourcing.
Comput. Oper. Res., 2014

Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility.
Ad Hoc Networks, 2014

2013
A Bilevel p-median model for the planning and protection of critical facilities.
J. Heuristics, 2013

2012
Incorporating the threat of terrorist attacks in the design of public service facility networks.
Optim. Lett., 2012

A two-echelon stochastic facility location model for humanitarian relief logistics.
Optim. Lett., 2012

A leader-follower game in competitive facility location.
Comput. Oper. Res., 2012

Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks.
Comput. Oper. Res., 2012

A bilevel fixed charge location model for facilities under imminent attack.
Comput. Oper. Res., 2012

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals.
Proceedings of the Operations Research Proceedings 2012, 2012

A Branch-and-Price Algorithm for Split-Coloring Problem.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
A discrete competitive facility location model with variable attractiveness.
J. Oper. Res. Soc., 2011

Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem.
J. Oper. Res. Soc., 2011

Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution.
Eur. J. Oper. Res., 2011

Lifetime Maximization in Wireless Sensor Networks Using a Mobile Sink with Nonzero Traveling Time.
Comput. J., 2011

2010
Optimal placement, scheduling, and routing to maximize lifetime in sensor networks.
J. Oper. Res. Soc., 2010

A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks.
Eur. J. Oper. Res., 2010

Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks.
Comput. Networks, 2010

The budget constrained <i>r</i>-interdiction median problem with capacity expansion.
Central Eur. J. Oper. Res., 2010

An efficient heuristic for placement, scheduling and routing in wireless sensor networks.
Ad Hoc Networks, 2010

A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2010

2009
Solving probabilistic multi-facility Weber problem by vector quantization.
OR Spectr., 2009

A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations.
Eur. J. Oper. Res., 2009

Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations.
Comput. Oper. Res., 2009

2008
Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem.
J. Oper. Res. Soc., 2008

Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles.
Eur. J. Oper. Res., 2008

Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks.
Comput. Networks, 2008

2007
Open vehicle routing problem with driver nodes and time deadlines.
J. Oper. Res. Soc., 2007

Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms.
Proceedings of the Metaheuristics, 2007

2006
Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps.
J. Oper. Res. Soc., 2006

Effective coverage in sensor networks: Binary integer programming formulations and heuristics.
Proceedings of IEEE International Conference on Communications, 2006

2005
Optimal Prices and Trade-in Rebates for Durable, Remanufacturable Products.
Manuf. Serv. Oper. Manag., 2005

Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application.
Proceedings of the Operations Research Proceedings 2005, 2005

Customer Selection and Profit Maximization in Vehicle Routing Problems.
Proceedings of the Operations Research Proceedings 2005, 2005

2003
A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE.
IEEE Trans. Neural Networks, 2003

A self-organizing method for map reconstruction.
Proceedings of the NNSP 2003, 2003

2000
Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches.
Comput. Oper. Res., 2000

A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIES<sub>DECOMPOSE</sub>.
Proceedings of the ECAI 2000, 2000

1999
The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem.
Neural Networks, 1999

1998
Discrete vector quantization for arbitrary distance function estimation.
IEEE Trans. Syst. Man Cybern. Part B, 1998

1997
Vector Quantization for Arbitrary Distance Function Estimation.
INFORMS J. Comput., 1997

Arbitrary distance function estimation using discrete vector quantization.
Proceedings of International Conference on Neural Networks (ICNN'97), 1997

1995
Arbitrary distance function estimation using vector quantization.
Proceedings of International Conference on Neural Networks (ICNN'95), Perth, WA, Australia, November 27, 1995


  Loading...