Optimization Letters

Papers
(The median citation count of Optimization Letters is 1. 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-06-01 to 2025-06-01.)
ArticleCitations
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, 202034
On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes24
Cooperative congestion games: existence of a Nash-stable coalition structure20
Equilibrium uniqueness in aggregative games: very practical conditions20
Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set16
Constrained many-to-many point matching in two dimensions16
Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization14
A Riemannian subspace BFGS trust region method14
Comparing voting districts with uncertain data envelopment analysis13
On efficient algorithms for bottleneck path problems with many sources12
Integrated optimization of design and production process with personalization level of products12
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems11
A distributional Farkas’ lemma and moment optimization problems with no-gap dual semi-definite programs11
Guillotine cutting is asymptotically optimal for packing consecutive squares10
Uniqueness of solutions in multivariate Chebyshev approximation problems10
On the least square prenucleolus for games with externalities10
Pareto efficiency without topology10
A new convergence rate of the steepest descent regarding the Euclidean norm10
Branch-and-bound-and-memorize for the blocking permutation flowshop problem10
A simplified treatment of Ramana’s exact dual for semidefinite programming10
Using regression models to understand the impact of route-length variability in practical vehicle routing9
A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights9
Improved exploitation of higher order smoothness in derivative-free optimization9
On ambiguity-averse market equilibrium9
Well-posedness for the split equilibrium problem8
A global optimization approach to Berge equilibrium based on a regularized function8
An improved algorithm for parallel machine scheduling under additional resource constraints8
On partial descriptions of König graphs for odd paths and all their spanning supergraphs8
Stochastic saddle-point optimization for the Wasserstein barycenter problem8
Linear convergence rate analysis of proximal generalized ADMM for convex composite programming7
A conditional-logic interpretation for Miller–Tucker–Zemlin inequalities and extensions7
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times7
On linear algebraic algorithms for the subgraph matching problem and its variants7
Cooperation in combinatorial search7
A general variable neighborhood search approach for the minimum load coloring problem7
Distributionally-robust machine learning using locally differentially-private data7
Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces7
The multilevel facility location and pricing problems: the computational complexity and the stability analysis7
Convergence rate analysis of proximal iteratively reweighted $$\ell _1$$ methods for $$\ell _p$$ regularization problems7
Higher-order optimality conditions of robust Benson proper efficient solutions in uncertain vector optimization problems7
A computational study on QP problems with general linear constraints7
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost6
Hybrid variable neighborhood search for automated warehouse scheduling6
The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis6
Uniform convexity, uniform monotonicity and $$(\phi ,c)$$-subdifferentiability with application to nonlinear PDE6
Frugal and decentralised resolvent splittings defined by nonexpansive operators6
Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates6
A Non-polyhedral extension of the Frank–Wolfe theorem to cubic optimization6
A gradient method exploiting the two dimensional quadratic termination property6
A maximal-clique-based set-covering approach to overlapping community detection6
A new restricted memory level bundle method for constrained convex nonsmooth optimization6
Modeling a flexible staff scheduling problem in the Era of Covid-195
An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c5
Strategy investments in zero-sum games5
The budgeted maximin share allocation problem5
Convergence of a special partially augmented Lagrangian algorithm for sparsity-constrained optimization problems5
Sparse and risk diversification portfolio selection5
On coupling constraints in linear bilevel optimization5
A no-delay single machine scheduling problem to minimize total weighted early and late work5
General variable neighborhood search for the minimum stretch spanning tree problem5
2DPackLib: a two-dimensional cutting and packing library5
Stability approach to CDC truck scheduling problem under uncertainty5
Optimality conditions for robust weakly efficient solutions in uncertain optimization5
Convergence rates analysis of a multiobjective proximal gradient method5
Differentially private k-center problems5
A metaheuristic algorithm for efficient aircraft sequencing and scheduling in terminal maneuvering areas5
A study on the impact of selecting the follower’s reaction in solving semi-vectorial bilevel problems4
Representation of positive polynomials on a generalized strip and its application to polynomial optimization4
Matching orderable and separable hypergraphs4
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem4
Mixed-integer linear optimization for cardinality-constrained random forests4
Polyhedral results and stronger Lagrangean bounds for stable spanning trees4
On an effective approach in shape optimization problem for Stokes equation4
Existence of the least element solution of the vertical block Z-tensor complementarity problem4
Online total bipartite matching problem4
Expansions of the characteristic polynomial of a perturbed PSD matrix and convergence analysis of alternating projections for the PSD cone and a line4
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems4
Nested-solution facility location models4
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations4
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach4
Optimality conditions for homogeneous polynomial optimization on the unit sphere4
Wildfire burn scar encapsulation4
Spatial branching for a special class of convex MIQO problems4
Efficient online sensitivity analysis for the injective bottleneck path problem4
A strict complementarity approach to error bound and sensitivity of solution of conic programs4
Optimal step length for the maximal decrease of a self-concordant function by the Newton method4
Optimal externalities in a parallel transportation network4
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools4
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization4
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints4
A decomposition algorithm for distributionally robust chance-constrained programs with polyhedral ambiguity set3
The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors3
Improvement of convergence criteria for finding common fixed points of multiple finite demicontractive mappings3
Optimal TSP tour length estimation using Sammon maps3
A general VNS for the multi-depot open vehicle routing problem with time windows3
Solution methodologies for minimizing a sum of pointwise minima of two functions3
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming3
Duality in the problems of optimal control described by Darboux-type differential inclusions3
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups3
Linearized formulations for failure aware barter exchange3
A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem3
The semiproximal SVM approach for multiple instance learning: a kernel-based computational study3
A linearized method for solving tensor complementarity problems with implicit Z-tensors3
A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm3
Scheduling coupled tasks on parallel identical machines3
Circumcentric directions of cones3
Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation3
The metric projection over a polyhedral set through the relative interiors of its faces3
A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization3
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems3
Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect3
Practical algorithm for minimum cost submodular cover problem with performance guarantees3
A monotonic optimization approach to mixed variational inequality problems3
A deep reinforcement learning framework for solving two-stage stochastic programs3
On the weak and strong convergence of modified forward-backward-half-forward splitting methods3
Economic lot-sizing problem with remanufacturing option: complexity and algorithms3
On the linear convergence rate of Riemannian proximal gradient method3
Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds3
On the diameter of a 2-sum of polyhedra3
A generalized Frank–Wolfe method with “dual averaging” for strongly convex composite optimization3
A note: on the two-stage flowshop with dedicated machines to minimize total load3
On penalized reload cost path, walk, tour and maximum flow: hardness and approximation3
An inventory model for multiple items assuming time-varying demands and limited storage3
On refinement strategies for solving $${\textsc {MINLP}\mathrm{s}}$$  by piecewise linear relaxations: a generalized red refinement3
Dual and generalized dual cones in Banach spaces3
Symmetric positive subdefinite tensors3
An exact penalty function method for optimal control of a dubins airplane in the presence of moving obstacles3
A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network2
Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration2
Mixed lattice structures and cone projections2
On self-concordant barriers for generalized power cones2
Local error bounds for the generalized polynomial complementarity problem2
Goldstein stationarity in Lipschitz constrained optimization2
A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem2
On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems2
Degree sequence optimization in bounded treewidth2
On atomic cliques in temporal graphs2
A comprehensive theoretical framework for the optimization of neural networks classification performance with respect to weighted metrics2
Method for finding solution to “quasidifferentiable” differential inclusion2
Worst-case evaluation complexity of a derivative-free quadratic regularization method2
The multi-depot k-traveling repairman problem2
Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem2
A modification of the forward–backward splitting method for monotone inclusions2
Approximate properly solutions of constrained vector optimization with variable coradiant sets2
Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $$\ell _\infty$$-norm objectives2
The forward–backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces2
Trigonometric approximation of the Max-Cut polytope is star-like2
Complexity bound of a Levenberg–Marquardt algorithm based on probabilistic Jacobian models2
Nicely structured positive bases with maximal cosine measure2
New smooth weighted complementarity functions and a cubically convergent method for wLCP2
Determining optimal channel partition for 2:4 fine grained structured sparsity2
Structured $$(\min ,+)$$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems2
Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points2
On maximal and minimal elements for sets with respect to cones2
A closed-form bound on the asymptotic linear convergence of iterative methods via fixed point analysis2
Kernel $$\ell ^1$$-norm principal component analysis for denoising2
Tensor denoising via dual Schatten norms2
A note on the hierarchical multi-switch multi-echelon vehicle routing problem2
Expected value based optimal control for discrete-time stochastic noncausal systems2
Constrained optimization based adversarial example generation for transfer attacks in network intrusion detection systems2
An exact explicit dual for the linear copositive programming problem2
Biased random-key genetic algorithms for the minimum subgraph diameter problem2
On the proximal mapping for multi-valued monotone variational inequality problems2
A VNS based framework for early diagnosis of the Alzheimer's disease converted from mild cognitive impairment2
Complexity of near-optimal robust versions of multilevel optimization problems2
An optimization approach to coalition formation in centralized EOQ problems with additive transportation costs2
Rates of asymptotic regularity for the alternating Halpern–Mann iteration2
Practical approximation algorithms for $${\ell}_1$$-regularized sparse rank-1 approximation to higher-order tensors2
Dissecting the duality gap: the supporting hyperplane interpretation revisited2
Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems2
A fresh geometrical look at the general S-procedure2
Solving the probabilistic profitable tour problem on a line2
Minimizing the influence spread over a network through node interception2
Exact separation theorem for disjoint closed sets in Hilbert spaces2
Feature selection in machine learning via variable neighborhood search2
An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance2
An uncertain minimization problem: robust optimization versus optimization of robustness2
A folding preprocess for the max k-cut problem2
Mixed-integer linearity in nonlinear optimization: a trust region approach2
A discrete competitive facility location model with proportional and binary rules sequentially applied1
Characterization of set-valued robustness via extended signed distances and separation1
Log-domain interior-point methods for convex quadratic programming1
Convergence rates of training deep neural networks via alternating minimization methods1
Strengthened MIP formulations for the liver region redesign models of Akshat et al.1
Conveyor operations in distribution centers: modeling and optimization1
Hybrid strategy in multiperiod mean-variance framework1
A note on overrelaxation in the Sinkhorn algorithm1
Minsum scheduling with acceptable lead-times and optional job rejection1
Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping1
Validation of scenario generation for decision-making using machine learning prediction models1
Computing tighter bounds on the n-queens constant via Newton’s method1
On the new modulus-based matrix splitting method for linear complementarity problem of $$H_{+}$$-matrix1
Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties1
A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem1
Merton portfolio allocation under stochastic dividends1
Modeling the spread of infectious diseases through influence maximization1
A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces1
On proper minimality in set optimization1
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program1
Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension1
Are weaker stationarity concepts of stochastic MPCC problems significant in absence of SMPCC-LICQ?1
Optimal control for production inventory of uncertain random system with jump and deteriorating items1
Convergence rates of damped inerial dynamics from multi-degree-of-freedom system1
A matrix-free trust-region newton algorithm for convex-constrained optimization1
Optimal override policy for chemotherapy scheduling template via mixed-integer linear programming1
Characterizations of the solution set for tangentially convex optimization problems1
Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions1
Hausdorff continuity of solution maps to equilibrium problems via the oriented distance function1
Local linear convergence of proximal coordinate descent algorithm1
Proximal gradient methods with inexact oracle of degree q for composite optimization1
Distributionally robust joint chance-constrained support vector machines1
A polytime preprocess algorithm for the maximum independent set problem1
Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms1
A faster heuristic for the traveling salesman problem with drone1
Proximal operator and optimality conditions for ramp loss SVM1
On the solution existence and stability of polynomial optimization problems1
On sparse solution of tensor complementarity problem1
A new feasible moving ball projection algorithm for pseudomonotone variational inequalities1
Bin packing with divisible item sizes and rejection penalties1
An accelerated lyapunov function for Polyak’s Heavy-ball on convex quadratics1
The set partitioning problem in a quantum context1
Existence and generic stability conditions of equilibrium points to controlled systems for n-player multiobjective generalized games using the Kakutani–Fan–Glicksberg fixed-point theorem1
Practical initialization of the Nelder–Mead method for computationally expensive optimization problems1
Robustness of solutions to the capacitated facility location problem with uncertain demand1
Triply stochastic sequential assignment problem with the uncertainty in worker survival1
Individual and cooperative portfolio optimization as linear program1
Comments on finite termination of the generalized Newton method for absolute value equations1
Benchmark-based deviation and drawdown measures in portfolio optimization1
Review on the book Anatoly Zhigljavsky, Antanas Žilinskas “Bayesian and High-Dimensional Global Optimization”, SpringerBriefs in Optimization, Springer, 20211
Approximation algorithms for the restricted k-Chinese postman problems with penalties1
A projected splitting method for vertical tensor complementarity problems1
Upper semicontinuity of the solution map to a parametric boundary optimal control problem with unbounded constraint sets1
Extension of the value function reformulation to multiobjective bilevel optimization1
New second-order limiting directional derivatives and C$$^1$$-optimization1
General variable neighborhood search for the parallel machine scheduling problem with two common servers1
On a new simple algorithm to compute the resolvents1
Subdifferentials of convex matrix-valued functions1
Numerical solution of delay fractional optimal control problems with free terminal time1
Robust inventory problem with budgeted cumulative demand uncertainty1
Regularization of vector equilibrium problems1
On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms1
The truck–drone routing optimization problem: mathematical model and a VNS approach1
Globally solving a class of bilevel programs with spatial price equilibrium constraints1
Implicit steepest descent algorithm for optimization with orthogonality constraints1
Hausdorff continuity conditions for parametric nonconvex equilibrium problems1
Linear-size formulations for connected planar graph partitioning and political districting1
Buffered and Reduced Multidimensional Distribution Functions and Their Application in Optimization1
Correction to: Two‑machine flow shop scheduling with convex resource consumption functions1
The rendezvous vehicle routing problem1
An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences1
0.21226906776428