# | Title | Journal | Year | Citations |
---|
|
1 | The vehicle routing problem with drones: several worst-case results | Optimization Letters | 2017 | 349 |
2 | A generalized Newton method for absolute value equations | Optimization Letters | 2009 | 188 |
3 | TTT plots: a perl program to create time-to-target plots | Optimization Letters | 2007 | 176 |
4 | A two-echelon stochastic facility location model for humanitarian relief logistics | Optimization Letters | 2012 | 162 |
5 | The sparsest solutions to Z-tensor complementarity problems | Optimization Letters | 2017 | 127 |
6 | Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems | Optimization Letters | 2009 | 126 |
7 | Absolute value equation solution via concave minimization | Optimization Letters | 2006 | 118 |
8 | Mesh adaptive direct search algorithms for mixed variable optimization | Optimization Letters | 2009 | 113 |
9 | Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings | Optimization Letters | 2018 | 113 |
10 | A column generation-based heuristic algorithm for an inventory routing problem with perishable goods | Optimization Letters | 2013 | 99 |
11 | ARGONAUT: AlgoRithms for Global Optimization of coNstrAined grey-box compUTational problems | Optimization Letters | 2017 | 99 |
12 | Optimal kernel selection in twin support vector machines | Optimization Letters | 2009 | 97 |
13 | An iterative method for split variational inclusion problem and fixed point problem for a nonexpansive mapping | Optimization Letters | 2014 | 92 |
14 | A trust region SQP algorithm for mixed-integer nonlinear programming | Optimization Letters | 2007 | 90 |
15 | Global optimization by continuous grasp | Optimization Letters | 2007 | 88 |
16 | A parallel matheuristic for the technician routing and scheduling problem | Optimization Letters | 2013 | 86 |
17 | Solving proximal split feasibility problems without prior knowledge of operator norms | Optimization Letters | 2014 | 84 |
18 | An iterative method for solving absolute value equations and sufficient conditions for unique solvability | Optimization Letters | 2014 | 82 |
19 | A taxonomy for emergency service station location problem | Optimization Letters | 2012 | 80 |
20 | The GLOBAL optimization method revisited | Optimization Letters | 2008 | 79 |
21 | The Picard–HSS iteration method for absolute value equations | Optimization Letters | 2014 | 79 |
22 | Exact identification of critical nodes in sparse networks via new compact formulations | Optimization Letters | 2014 | 77 |
23 | A sliding time window heuristic for open pit mine block sequencing | Optimization Letters | 2011 | 76 |
24 | Adaptive energy efficient sensor scheduling for wireless sensor networks | Optimization Letters | 2010 | 75 |
25 | Higher order numerical differentiation on the Infinity Computer | Optimization Letters | 2011 | 74 |
26 | Strong convergence of a proximal point algorithm with general errors | Optimization Letters | 2012 | 74 |
27 | A unified network performance measure with importance identification and the ranking of network components | Optimization Letters | 2007 | 73 |
28 | Modelling the mobile target covering problem using flying drones | Optimization Letters | 2016 | 73 |
29 | A multi-step class of iterative methods for nonlinear systems | Optimization Letters | 2014 | 72 |
30 | Heuristic solutions for the vehicle routing problem with time windows and synchronized visits | Optimization Letters | 2016 | 71 |
31 | On an iterative method for solving absolute value equations | Optimization Letters | 2012 | 69 |
32 | Transversality conditions for infinite horizon variational problems on time scales | Optimization Letters | 2011 | 66 |
33 | Optimal due-date assignment problem with learning effect and resource-dependent processing times | Optimization Letters | 2014 | 65 |
34 | General infinite dimensional duality and applications to evolutionary network equilibrium problems | Optimization Letters | 2007 | 64 |
35 | The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function | Optimization Letters | 2014 | 64 |
36 | On unique solvability of the absolute value equation | Optimization Letters | 2009 | 63 |
37 | Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds | Optimization Letters | 2010 | 62 |
38 | A note on absolute value equations | Optimization Letters | 2010 | 62 |
39 | Discretization orders for distance geometry problems | Optimization Letters | 2012 | 62 |
40 | The optimal solution set of the interval linear programming problems | Optimization Letters | 2013 | 62 |
41 | The discretizable distance geometry problem | Optimization Letters | 2012 | 61 |
42 | Parameterized computational complexity of finding small-diameter subgraphs | Optimization Letters | 2012 | 61 |
43 | Self adaptive inertial subgradient extragradient algorithms for solving pseudomonotone variational inequality problems | Optimization Letters | 2020 | 61 |
44 | The split feasibility problem with multiple output sets in Hilbert spaces | Optimization Letters | 2020 | 60 |
45 | Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery | Optimization Letters | 2013 | 59 |
46 | An improved bit parallel exact maximum clique algorithm | Optimization Letters | 2013 | 59 |
47 | Optimal solutions for the double row layout problem | Optimization Letters | 2013 | 59 |
48 | Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques | Optimization Letters | 2020 | 59 |
49 | Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem | Optimization Letters | 2021 | 58 |
50 | New inertial relaxed method for solving split feasibilities | Optimization Letters | 2021 | 57 |