| Minimum cost flow problem with conflicts | 0 | 0.34 | 2021 |
| A trilevel -interdiction selective multi-depot vehicle routing problem with depot protection. | 0 | 0.34 | 2020 |
| Minimizing the misinformation spread in social networks | 0 | 0.34 | 2020 |
| The R-Interdiction Selective Multi-Depot Vehicle Routing Problem | 0 | 0.34 | 2020 |
| Influence Maximization With Deactivation In Social Networks. | 2 | 0.40 | 2019 |
| Optimized Resource Allocation and Task Offload Orchestration for Service-Oriented Networks. | 0 | 0.34 | 2019 |
| An Adaptive Large Neighborhood Search Heuristic for Jointly Solving Storage Location Assignment and Picker Routing Problem. | 0 | 0.34 | 2018 |
| Optimal sensor deployment to increase the security of the maximal breach path in border surveillance. | 2 | 0.38 | 2017 |
| Wireless sensor network design by lifetime maximisation: an empirical evaluation of integrating major design issues and sink mobility. | 4 | 0.40 | 2016 |
| Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals. | 9 | 0.48 | 2016 |
| Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks. | 1 | 0.35 | 2015 |
| Approximating the objective function׳s gradient using perceptrons for constrained minimization with application in drag reduction | 1 | 0.39 | 2015 |
| Minimum Cost Noncrossing Flow Problem on a Layered Network. | 0 | 0.34 | 2015 |
| A bilevel partial interdiction problem with capacitated facilities and demand outsourcing | 21 | 0.71 | 2014 |
| Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility | 40 | 1.31 | 2014 |
| Optimal berth allocation and time-invariant quay crane assignment in container terminals. | 23 | 0.94 | 2014 |
| A Bilevel p-median model for the planning and protection of critical facilities | 7 | 0.46 | 2013 |
| A two-echelon stochastic facility location model for humanitarian relief logistics. | 31 | 1.12 | 2012 |
| Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks | 7 | 0.49 | 2012 |
| A bilevel fixed charge location model for facilities under imminent attack | 24 | 0.74 | 2012 |
| A leader-follower game in competitive facility location | 15 | 0.70 | 2012 |
| A Branch-and-Price Algorithm for Split-Coloring Problem. | 0 | 0.34 | 2012 |
| Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals. | 2 | 0.37 | 2012 |
| Incorporating the threat of terrorist attacks in the design of public service facility networks. | 9 | 0.54 | 2012 |
| A discrete competitive facility location model with variable attractiveness. | 5 | 0.48 | 2011 |
| Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution | 24 | 0.96 | 2011 |
| Lifetime Maximization in Wireless Sensor Networks Using a Mobile Sink with Nonzero Traveling Time | 6 | 0.49 | 2011 |
| Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem. | 0 | 0.34 | 2011 |
| A hybrid tabu search heuristic for a bilevel competitive facility location model | 4 | 0.46 | 2010 |
| Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks | 21 | 1.03 | 2010 |
| Optimal placement, scheduling, and routing to maximize lifetime in sensor networks | 5 | 0.47 | 2010 |
| The budget constrained r-interdiction median problem with capacity expansion. | 26 | 1.11 | 2010 |
| A tabu search heuristic for point coverage, sink location, and data routing in wireless sensor networks | 3 | 0.39 | 2010 |
| An efficient heuristic for placement, scheduling and routing in wireless sensor networks | 7 | 0.60 | 2010 |
| A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks | 11 | 0.59 | 2010 |
| A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations | 8 | 0.56 | 2009 |
| Solving probabilistic multi-facility Weber problem by vector quantization | 2 | 0.39 | 2009 |
| Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations | 4 | 0.46 | 2009 |
| Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks | 45 | 1.79 | 2008 |
| Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles | 32 | 1.43 | 2008 |
| Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps | 2 | 0.44 | 2006 |
| Effective Coverage In Sensor Networks: Binary Integer Programming Formulations And Heuristics | 4 | 0.47 | 2006 |
| Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application | 2 | 0.56 | 2005 |
| Optimal Prices and Trade-in Rebates for Durable, Remanufacturable Products | 35 | 2.13 | 2005 |
| Customer Selection and Profit Maximization in Vehicle Routing Problems | 2 | 0.39 | 2005 |
| A self-organizing method for map reconstruction | 0 | 0.34 | 2003 |
| Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches | 9 | 0.63 | 2000 |
| A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE | 3 | 0.41 | 2000 |
| Discrete vector quantization for arbitrary distance function estimation. | 1 | 0.35 | 1998 |
| Vector Quantization for Arbitrary Distance Function Estimation | 3 | 0.50 | 1997 |
