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 2021-03-01 to 2025-03-01.)
ArticleCitations
A fresh geometrical look at the general S-procedure31
An approximation algorithm for the k-generalized Steiner forest problem19
Primal-dual subgradient method for constrained convex optimization problems18
On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes17
Preface to the special issue dedicated to the International Conference “Mathematical optimization theory and Operations Research” (MOTOR 2020) held online from July 6 to July 10, 202015
On sparse solution of tensor complementarity problem15
Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs13
Online NDP-constraint scheduling of jobs with delivery times or weights13
The set partitioning problem in a quantum context12
A polytime preprocess algorithm for the maximum independent set problem12
A distributional Farkas’ lemma and moment optimization problems with no-gap dual semi-definite programs12
On efficient algorithms for bottleneck path problems with many sources11
Strong convergence of inertial subgradient extragradient algorithm for solving pseudomonotone equilibrium problems11
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem10
Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights10
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints10
Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties10
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach9
Nested-solution facility location models9
On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces8
Shortest path network problems with stochastic arc weights8
Optimization of boundary value problems for higher order differential inclusions and duality8
Tight bounds on Lyapunov rank8
Matching orderable and separable hypergraphs8
Designing an optimal contract mechanism in a cellulosic biofuel enterprise8
On lower and upper bounds for single machine parallel batch scheduling8
Review on the book Anatoly Zhigljavsky, Antanas Žilinskas “Bayesian and High-Dimensional Global Optimization”, SpringerBriefs in Optimization, Springer, 20218
t-Linearization for the maximum diversity problem8
Optimal externalities in a parallel transportation network7
A note on approximate proper efficiency in linear fractional vector optimization7
A strict complementarity approach to error bound and sensitivity of solution of conic programs7
Efficient compact linear programs for network revenue management7
Connectedness of the solution sets in generalized semi-infinite set optimization7
A class of new modulus-based matrix splitting methods for linear complementarity problem7
Zeroth-order methods for noisy Hölder-gradient functions7
Nonsmooth rank-one matrix factorization landscape7
Optimality conditions for homogeneous polynomial optimization on the unit sphere7
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations7
Constrained optimization based adversarial example generation for transfer attacks in network intrusion detection systems7
A low-rank spectral method for learning Markov models7
Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions7
Computing tighter bounds on the n-queens constant via Newton’s method7
A step-truncated method in a wide neighborhood interior-point algorithm for linear programming7
A unified analysis of convex and non-convex $$\ell _p$$-ball projection problems7
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools6
On an effective approach in shape optimization problem for Stokes equation6
Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form6
Minimizing the influence spread over a network through node interception6
Subdifferentials of convex matrix-valued functions6
Comparing voting districts with uncertain data envelopment analysis6
Feature selection in machine learning via variable neighborhood search6
The truck–drone routing optimization problem: mathematical model and a VNS approach6
Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization6
A modification of the forward–backward splitting method for monotone inclusions6
A novel one-parameter filled function method with an application to pathological analysis6
Dependence in constrained Bayesian optimization6
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems6
Decentralized bilevel optimization6
General variable neighborhood search approach to group steiner tree problem5
An uncertain minimization problem: robust optimization versus optimization of robustness5
A Riemannian subspace BFGS trust region method5
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems5
Method for finding solution to “quasidifferentiable” differential inclusion5
Regularization of vector equilibrium problems5
Kernel $$\ell ^1$$-norm principal component analysis for denoising5
Polyhedral results and stronger Lagrangean bounds for stable spanning trees5
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization5
Tensor denoising via dual Schatten norms5
Integrated optimization of design and production process with personalization level of products5
On maximal and minimal elements for sets with respect to cones4
The metric projection over a polyhedral set through the relative interiors of its faces4
Dynamic resource allocation and collaborative scheduling in R&D and manufacturing processes of high-end equipment with budget constraint4
Guillotine cutting is asymptotically optimal for packing consecutive squares4
Decentralized scheduling with precedence constraints4
Theoretical analysis of integer programming models for the two-dimensional two-staged knapsack problem4
Single machine scheduling with maintenance and position-based job eligibility constraints for battery manufacturing4
Expected value based optimal control for discrete-time stochastic noncausal systems4
Spatial price equilibrium networks with flow-dependent arc multipliers4
Minimum budget for misinformation detection in online social networks with provable guarantees4
Review on the book Yaroslav D. Sergeyev, Renato De Leone (Eds.) Numerical infinities and infinitesimals in optimization4
Optimal override policy for chemotherapy scheduling template via mixed-integer linear programming4
A link between the steepest descent method and fixed-point iterations4
The multi-depot k-traveling repairman problem4
Wildfire burn scar encapsulation4
Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications4
Optimal step length for the maximal decrease of a self-concordant function by the Newton method4
Correction to: A no-delay single machine scheduling problem to minimize total weighted early and late work4
A deep reinforcement learning framework for solving two-stage stochastic programs4
Equilibrium uniqueness in aggregative games: very practical conditions4
Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set4
Constrained many-to-many point matching in two dimensions4
A block coordinate descent method for sensor network localization4
Cooperative congestion games: existence of a Nash-stable coalition structure4
A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation3
Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect3
Pareto efficiency without topology3
Regularized quasi-monotone method for stochastic optimization3
Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models3
An improved algorithm for parallel machine scheduling under additional resource constraints3
A note on Anti-Nash equilibrium for bimatrix game3
Bin packing with divisible item sizes and rejection penalties3
Using regression models to understand the impact of route-length variability in practical vehicle routing3
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups3
Dual and generalized dual cones in Banach spaces3
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems3
Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions3
A general VNS for the multi-depot open vehicle routing problem with time windows3
Log-domain interior-point methods for convex quadratic programming3
Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem3
Circumcentric directions of cones3
Robustness of solutions to the capacitated facility location problem with uncertain demand3
On ambiguity-averse market equilibrium3
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program3
Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation3
Approximation algorithms for the k-depots Hamiltonian path problem3
On refinement strategies for solving $${\textsc {MINLP}\mathrm{s}}$$  by piecewise linear relaxations: a generalized red refinement3
Convergence of Lasserre’s hierarchy: the general case3
Implicit steepest descent algorithm for optimization with orthogonality constraints3
A generalized Frank–Wolfe method with “dual averaging” for strongly convex composite optimization3
Practical initialization of the Nelder–Mead method for computationally expensive optimization problems3
Lower bounds of the solution set of the polynomial complementarity problem3
A discrete competitive facility location model with proportional and binary rules sequentially applied3
Optimal TSP tour length estimation using Sammon maps3
A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights3
Existence and generic stability conditions of equilibrium points to controlled systems for n-player multiobjective generalized games using the Kakutani–Fan–Glicksberg fixed-point theorem3
Gain-optimized spectral distortions for pronunciation training3
On partial descriptions of König graphs for odd paths and all their spanning supergraphs3
On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression3
On properties of univariate max functions at local maximizers3
Improved exploitation of higher order smoothness in derivative-free optimization3
0.13401508331299