Optimization Letters

Papers
(The TQCC of Optimization Letters is 3. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-10-01 to 2024-10-01.)
ArticleCitations
A class of new modulus-based matrix splitting methods for linear complementarity problem26
Explicit extragradient-like method with adaptive stepsizes for pseudomonotone variational inequalities22
On the unique solution of the generalized absolute value equation22
Personnel scheduling during Covid-19 pandemic21
Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights18
Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints18
A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem16
Closing the gap in linear bilevel optimization: a new valid primal-dual inequality16
Modeling the spread of infectious diseases through influence maximization15
A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order13
Approximation algorithms for the multiprocessor scheduling with submodular penalties13
Modeling a flexible staff scheduling problem in the Era of Covid-1912
Edge metric dimensions via hierarchical product and integer linear programming12
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming12
A new concave minimization algorithm for the absolute value equation solution12
Proximal operator and optimality conditions for ramp loss SVM12
Convergence rates analysis of a multiobjective proximal gradient method12
A new DIRECT-GLh algorithm for global optimization with hidden constraints11
A dynamic programming algorithm for solving the k-Color Shortest Path Problem11
Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping11
Resolvent of the parallel composition and the proximity operator of the infimal postcomposition10
Minimum budget for misinformation detection in online social networks with provable guarantees10
Convergence of Lasserre’s hierarchy: the general case10
Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects10
Practical initialization of the Nelder–Mead method for computationally expensive optimization problems10
Bounds of the solution set of the tensor complementarity problem9
Spatial price equilibrium networks with flow-dependent arc multipliers9
2DPackLib: a two-dimensional cutting and packing library9
On the Burer–Monteiro method for general semidefinite programs9
An efficient heuristic for a hub location routing problem8
Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data8
Gain-optimized spectral distortions for pronunciation training8
A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations8
A resiliency analysis of information distribution policies over mobile ad hoc networks8
Existence and generic stability conditions of equilibrium points to controlled systems for n-player multiobjective generalized games using the Kakutani–Fan–Glicksberg fixed-point theorem8
Complexity of near-optimal robust versions of multilevel optimization problems8
QN-tensor and tensor complementarity problem8
Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces8
Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location7
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups7
Two-Bar Charts Packing Problem7
Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach7
Optimization approach to Berge equilibrium for bimatrix game7
Games with distributionally robust joint chance constraints7
Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance7
On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space7
Strong convergence of inertial subgradient extragradient algorithm for solving pseudomonotone equilibrium problems7
Existence of the least element solution of the vertical block Z-tensor complementarity problem6
A descent extension of a modified Polak–Ribière–Polyak method with application in image restoration problem6
Numerical solution of delay fractional optimal control problems with free terminal time6
Improved exploitation of higher order smoothness in derivative-free optimization6
Zeroth-order methods for noisy Hölder-gradient functions6
General variable neighborhood search for the parallel machine scheduling problem with two common servers6
On atomic cliques in temporal graphs6
Some notes on the solvability conditions for absolute value equations6
On quantitative stability in infinite-dimensional optimization under uncertainty6
Distributionally robust joint chance-constrained support vector machines6
Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates6
A general VNS for the multi-depot open vehicle routing problem with time windows6
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach6
NPROS: A Not So Pure Random Orthogonal search algorithm—A suite of random optimization algorithms driven by reinforcement learning5
Conditions for linear convergence of the gradient method for non-convex optimization5
A deep reinforcement learning framework for solving two-stage stochastic programs5
Statistical robustness of two-stage stochastic variational inequalities5
On self-concordant barriers for generalized power cones5
An effective version of Schmüdgen’s Positivstellensatz for the hypercube5
Commutation principles for optimization problems on spectral sets in Euclidean Jordan algebras5
The single train shortest route problem in a railyard5
Lower bounds of the solution set of the polynomial complementarity problem5
On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression5
On lattice point counting in $$\varDelta $$-modular polyhedra5
Strong convergence theorems for inertial Tseng’s extragradient method for solving variational inequality problems and fixed point problems5
On periodic solution to control problem with time-driven switching5
Approximating the product knapsack problem5
Analytic solution of the continuous particle swarm optimization problem5
Implicit steepest descent algorithm for optimization with orthogonality constraints5
Computationally efficient approach for solving lexicographic multicriteria optimization problems5
Vehicle routing problem considering equity of demand satisfaction5
Minsum scheduling with acceptable lead-times and optional job rejection5
The moment-SOS hierarchy and the Christoffel–Darboux kernel5
Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration4
On the new modulus-based matrix splitting method for linear complementarity problem of $$H_{+}$$-matrix4
The assignment problem revisited4
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems4
A block coordinate descent method for sensor network localization4
Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems4
A note on the hierarchical multi-switch multi-echelon vehicle routing problem4
Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem4
On the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization4
On the exact solution of the multi-depot open vehicle routing problem4
Robustness of solutions to the capacitated facility location problem with uncertain demand4
Using regression models to understand the impact of route-length variability in practical vehicle routing4
The multi-depot k-traveling repairman problem4
Unified linear convergence of first-order primal-dual algorithms for saddle point problems4
Homogeneous polynomials and spurious local minima on the unit sphere4
Bregman circumcenters: monotonicity and forward weak convergence4
Directional asymptotics of Fejér monotone sequences4
A covering traveling salesman problem with profit in the last mile delivery4
A matrix-free trust-region newton algorithm for convex-constrained optimization4
The quasidifferential descent method in a control problem with nonsmooth objective functional4
Expected value based optimal control for discrete-time stochastic noncausal systems4
The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions4
Sample average approximations of strongly convex stochastic programs in Hilbert spaces4
A robust model for the lot-sizing problem with uncertain demands3
A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm3
Optimization models for integrated biorefinery operations3
A note on Anti-Nash equilibrium for bimatrix game3
Linear and conic reformulations for the maximum capture location problem under multinomial logit choice3
Prediction of annual CO2 emissions at the country and sector levels, based on a matrix completion optimization problem3
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program3
Less is more approach in optimization: a road to artificial intelligence3
Online NDP-constraint scheduling of jobs with delivery times or weights3
Optimal multi-state partnerships for woody biomass co-firing incorporating a demand-response function for biomass procurement3
A General Variable Neighborhood Search approach based on a p-median model for cellular manufacturing problems3
A closed-form bound on the asymptotic linear convergence of iterative methods via fixed point analysis3
On the convergence of a class of inertial dynamical systems with Tikhonov regularization3
Iterated local search for the generalized independent set problem3
The subdifferential descent method in a nonsmooth variational problem3
Relating $$\ell _p$$ regularization and reweighted $$\ell _1$$ regularization3
Scheduling with generalized and periodic due dates under single- and two-machine environments3
Log-domain interior-point methods for convex quadratic programming3
Two-machine flow shop scheduling with convex resource consumption functions3
A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights3
Extension of the value function reformulation to multiobjective bilevel optimization3
Approximation algorithms for the k-depots Hamiltonian path problem3
A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak3
Constrained optimization based adversarial example generation for transfer attacks in network intrusion detection systems3
Solving the probabilistic profitable tour problem on a line3
Kernel $$\ell ^1$$-norm principal component analysis for denoising3
On generalized convex functions and generalized subdifferential II3
Siting renewable power generation assets with combinatorial optimisation3
Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits3
Douglas–Rachford splitting algorithm for solving state-dependent maximal monotone inclusions3
Finding optimal solutions to several gray pattern instances3
Using neural networks to solve linear bilevel problems with unknown lower level3
A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces3
Inverse integer optimization with multiple observations3
Circumcentric directions of cones3
Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games3
Feature selection in machine learning via variable neighborhood search3
Conveyor operations in distribution centers: modeling and optimization3
Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions3
Mixed-integer linear optimization for full truckload pickup and delivery3
Designing an optimal contract mechanism in a cellulosic biofuel enterprise3
Multi-objective home health care routing: a variable neighborhood search method3
Chebyshev center and inscribed balls: properties and calculations3
0.10667204856873