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-02-01 to 2024-02-01.)
ArticleCitations
New inertial relaxed method for solving split feasibilities49
The split feasibility problem with multiple output sets in Hilbert spaces46
The Big-M method with the numerical infinite M45
Distributionally robust optimization with decision dependent ambiguity sets33
Explicit extragradient-like method with adaptive stepsizes for pseudomonotone variational inequalities19
Disciplined quasiconvex programming17
On the convergence rate of the Halpern-iteration17
On the unique solution of the generalized absolute value equation16
A branch-and-bound embedded genetic algorithm for resource-constrained project scheduling problem with resource transfer time of aircraft moving assembly line16
Personnel scheduling during Covid-19 pandemic15
Regularization projection method for solving bilevel variational inequality problem15
The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects15
An inertial Popov’s method for solving pseudomonotone variational inequalities14
Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights14
A note on partial calmness for bilevel optimization problems with linearly structured lower level13
A class of new modulus-based matrix splitting methods for linear complementarity problem13
A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem13
Approximation algorithms for the multiprocessor scheduling with submodular penalties13
Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints13
Closing the gap in linear bilevel optimization: a new valid primal-dual inequality11
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation11
Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules11
Mathematical formulations and improvements for the multi-depot open vehicle routing problem11
Existence results for vector variational inequality problems on Hadamard manifolds11
Modeling a flexible staff scheduling problem in the Era of Covid-1910
A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order10
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming10
A new concave minimization algorithm for the absolute value equation solution10
A new DIRECT-GLh algorithm for global optimization with hidden constraints9
Mathematical optimization approach for facility layout on several rows9
Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem9
Inverse optimal value problem on minimum spanning tree under unit $$l_{\infty }$$ norm9
Aggregate subgradient method for nonsmooth DC optimization9
Modeling the spread of infectious diseases through influence maximization9
Proximal operator and optimality conditions for ramp loss SVM8
Minimum budget for misinformation detection in online social networks with provable guarantees8
A dynamic programming algorithm for solving the k-Color Shortest Path Problem8
On the convergence of algorithms with Tikhonov regularization terms8
Edge metric dimensions via hierarchical product and integer linear programming8
A note on competing-agent Pareto-scheduling8
Convergence rates analysis of a multiobjective proximal gradient method8
Vector network equilibrium problems with uncertain demands and capacity constraints of arcs8
Online algorithms for the mixed ring loading problem with two nodes7
Complexity of near-optimal robust versions of multilevel optimization problems7
Games with distributionally robust joint chance constraints7
Two-Bar Charts Packing Problem7
An efficient heuristic for a hub location routing problem7
Convergence of Lasserre’s hierarchy: the general case7
Gain-optimized spectral distortions for pronunciation training7
Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects7
Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance7
Exact approaches for competitive facility location with discrete attractiveness7
Green supply chain design with emission sensitive demand: second order cone programming formulation and case study7
Spatial price equilibrium networks with flow-dependent arc multipliers6
Strong convergence of inertial subgradient extragradient algorithm for solving pseudomonotone equilibrium problems6
2DPackLib: a two-dimensional cutting and packing library6
A deterministic algorithm to compute the cosine measure of a finite positive spanning set6
A resiliency analysis of information distribution policies over mobile ad hoc networks6
Practical initialization of the Nelder–Mead method for computationally expensive optimization problems6
Zeroth-order methods for noisy Hölder-gradient functions6
Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach6
A linearly convergent stochastic recursive gradient method for convex optimization6
Resolvent of the parallel composition and the proximity operator of the infimal postcomposition6
Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces6
Existence and generic stability conditions of equilibrium points to controlled systems for n-player multiobjective generalized games using the Kakutani–Fan–Glicksberg fixed-point theorem6
On the Burer–Monteiro method for general semidefinite programs6
Hybrid iterative scheme for solving split equilibrium and hierarchical fixed point problems6
A new model for curriculum-based university course timetabling6
Bounds of the solution set of the tensor complementarity problem6
Unified linear convergence of first-order primal-dual algorithms for saddle point problems5
borealis—A generalized global update algorithm for Boolean optimization problems5
QN-tensor and tensor complementarity problem5
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups5
Computationally efficient approach for solving lexicographic multicriteria optimization problems5
Second-order characterizations of quasiconvexity and pseudoconvexity for differentiable functions with Lipschitzian derivatives5
On periodic solution to control problem with time-driven switching5
Three-dimensional stable matching with cyclic preferences5
Analytic solution of the continuous particle swarm optimization problem5
Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows5
Minimizing a sum of clipped convex functions5
Stochastic variational formulation for a general random time-dependent economic equilibrium problem5
A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem5
Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates5
Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location5
On quantitative stability in infinite-dimensional optimization under uncertainty5
A compact mixed integer linear formulation for safe set problems5
Implicit steepest descent algorithm for optimization with orthogonality constraints4
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach4
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems4
The forward–backward splitting method and its convergence rate for the minimization of the sum of two functions in Banach spaces4
Homogeneous polynomials and spurious local minima on the unit sphere4
The moment-SOS hierarchy and the Christoffel–Darboux kernel4
A parallel variable neighborhood search for solving covering salesman problem4
The assignment problem revisited4
Strong Karush–Kuhn–Tucker optimality conditions for weak efficiency in constrained multiobjective programming problems in terms of mordukhovich subdifferentials4
On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression4
Greedy approximation for the minimum connected dominating set with labeling4
The multi-depot k-traveling repairman problem4
Strong convergence theorems for inertial Tseng’s extragradient method for solving variational inequality problems and fixed point problems4
A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations4
A randomized heuristic repair for the multidimensional knapsack problem4
On the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization4
Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data4
On the computational complexity of uncapacitated multi-plant lot-sizing problems4
A matrix-free trust-region newton algorithm for convex-constrained optimization4
Vehicle routing problem considering equity of demand satisfaction4
Minsum scheduling with acceptable lead-times and optional job rejection4
Improved analysis of spectral algorithm for clustering4
Approximating the product knapsack problem4
The single train shortest route problem in a railyard4
Improved lower bound on the dimension of the EU council’s voting rules4
Numerical solution of delay fractional optimal control problems with free terminal time3
Robust Omega ratio optimization using regular vines3
Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping3
Linear and conic reformulations for the maximum capture location problem under multinomial logit choice3
Statistical robustness of two-stage stochastic variational inequalities3
Optimization approach to Berge equilibrium for bimatrix game3
On solving the order processing in picking workstations3
On lattice point counting in $$\varDelta $$-modular polyhedra3
A descent extension of a modified Polak–Ribière–Polyak method with application in image restoration problem3
Stability analysis for set-valued equilibrium problems with applications to Browder variational inclusions3
Efficient nearest neighbors methods for support vector machines in high dimensional feature spaces3
Directional asymptotics of Fejér monotone sequences3
Siting renewable power generation assets with combinatorial optimisation3
Optimization models for integrated biorefinery operations3
An efficient bidding heuristic for simultaneous truckload transportation auctions3
Solving a home energy management problem by Simulated Annealing3
Improved exploitation of higher order smoothness in derivative-free optimization3
General variable neighborhood search for the parallel machine scheduling problem with two common servers3
Robustness of solutions to the capacitated facility location problem with uncertain demand3
Designing an optimal contract mechanism in a cellulosic biofuel enterprise3
Less is more approach in optimization: a road to artificial intelligence3
Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set3
Optimality conditions for locally Lipschitz optimization with $$l_0$$-regularization3
The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions3
On generalized convex functions and generalized subdifferential II3
A closed-form bound on the asymptotic linear convergence of iterative methods via fixed point analysis3
Chebyshev center and inscribed balls: properties and calculations3
Some notes on the solvability conditions for absolute value equations3
Improved DE search for competing groups scheduling with deterioration effects3
On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space3
Distributionally robust joint chance-constrained support vector machines3
The quasidifferential descent method in a control problem with nonsmooth objective functional3
Inverse integer optimization with multiple observations3
Using regression models to understand the impact of route-length variability in practical vehicle routing3
A General Variable Neighborhood Search approach based on a p-median model for cellular manufacturing problems3
Models and linearizations for the Traveling Car Renter with Passengers3
Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem3
On self-concordant barriers for generalized power cones3
Sample average approximations of strongly convex stochastic programs in Hilbert spaces3
Bregman circumcenters: monotonicity and forward weak convergence3
Commutation principles for optimization problems on spectral sets in Euclidean Jordan algebras3
Finding optimal solutions to several gray pattern instances3
0.016294002532959