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-11-01 to 2025-11-01.)
ArticleCitations
Cooperative congestion games: existence of a Nash-stable coalition structure25
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, 202025
Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set25
Constrained many-to-many point matching in two dimensions18
Integrated optimization of design and production process with personalization level of products17
A Riemannian subspace BFGS trust region method17
Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization15
Comparing voting districts with uncertain data envelopment analysis14
A distributional Farkas’ lemma and moment optimization problems with no-gap dual semi-definite programs13
On efficient algorithms for bottleneck path problems with many sources12
Guillotine cutting is asymptotically optimal for packing consecutive squares11
On asymptotic global stability of linear variational inequalities in Hilbert space based on Hausdorff convergence11
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems11
Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit11
On ambiguity-averse market equilibrium10
A simplified treatment of Ramana’s exact dual for semidefinite programming10
On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes10
Branch-and-bound-and-memorize for the blocking permutation flowshop problem9
A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights9
A new convergence rate of the steepest descent regarding the Euclidean norm9
On the least square prenucleolus for games with externalities9
Using regression models to understand the impact of route-length variability in practical vehicle routing9
Uniqueness of solutions in multivariate Chebyshev approximation problems9
A semidefinite hierarchy for the expected independence number of a random graph8
Pareto efficiency without topology8
An improved algorithm for parallel machine scheduling under additional resource constraints8
Improved exploitation of higher order smoothness in derivative-free optimization8
Cooperation in combinatorial search7
Stochastic saddle-point optimization for the Wasserstein barycenter problem7
A global optimization approach to Berge equilibrium based on a regularized function7
Higher-order optimality conditions of robust Benson proper efficient solutions in uncertain vector optimization problems7
Linear convergence rate analysis of proximal generalized ADMM for convex composite programming7
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times7
A gradient projection algorithm based on the normal-S iterative algorithm: convergence analysis and machine learning application7
Convergence rate analysis of proximal iteratively reweighted $$\ell _1$$ methods for $$\ell _p$$ regularization problems6
Well-posedness for the split equilibrium problem6
A Non-polyhedral extension of the Frank–Wolfe theorem to cubic optimization6
A general variable neighborhood search approach for the minimum load coloring problem6
A conditional-logic interpretation for Miller–Tucker–Zemlin inequalities and extensions6
On linear algebraic algorithms for the subgraph matching problem and its variants6
The multilevel facility location and pricing problems: the computational complexity and the stability analysis6
The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis6
A computational study on QP problems with general linear constraints6
A maximal-clique-based set-covering approach to overlapping community detection5
Frugal and decentralised resolvent splittings defined by nonexpansive operators5
An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c5
Generator subadditive functions for mixed-integer programs5
A gradient method exploiting the two dimensional quadratic termination property5
The budgeted maximin share allocation problem5
Strategy investments in zero-sum games5
Sparse and risk diversification portfolio selection5
Differentially private k-center problems5
A no-delay single machine scheduling problem to minimize total weighted early and late work5
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost5
Hybrid variable neighborhood search for automated warehouse scheduling5
Convergence rates analysis of a multiobjective proximal gradient method5
On coupling constraints in linear bilevel optimization5
A metaheuristic algorithm for efficient aircraft sequencing and scheduling in terminal maneuvering areas5
A new restricted memory level bundle method for constrained convex nonsmooth optimization5
General variable neighborhood search for the minimum stretch spanning tree problem4
Optimality conditions for robust weakly efficient solutions in uncertain optimization4
Single-objective robust optimisation in bioprocessing with conformalised quantile regression as interval-based surrogate models4
On an effective approach in shape optimization problem for Stokes equation4
The metric projection over a polyhedral set through the relative interiors of its faces4
Expansions of the characteristic polynomial of a perturbed PSD matrix and convergence analysis of alternating projections for the PSD cone and a line4
Dual and generalized dual cones in Banach spaces4
Optimal externalities in a parallel transportation network4
On penalized reload cost path, walk, tour and maximum flow: hardness and approximation4
A study on the impact of selecting the follower’s reaction in solving semi-vectorial bilevel problems4
Mixed-integer linear optimization for cardinality-constrained random forests4
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints4
Duality in the problems of optimal control described by Darboux-type differential inclusions4
Online total bipartite matching problem4
Convergence of a special partially augmented Lagrangian algorithm for sparsity-constrained optimization problems4
Stability approach to CDC truck scheduling problem under uncertainty4
Polyhedral results and stronger Lagrangean bounds for stable spanning trees4
A note: on the two-stage flowshop with dedicated machines to minimize total load4
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems4
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization4
Greedy Newton: Newton’s method with exact line search4
Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds4
Matching orderable and separable hypergraphs4
A strict complementarity approach to error bound and sensitivity of solution of conic programs4
Existence of the least element solution of the vertical block Z-tensor complementarity problem4
Spatial branching for a special class of convex MIQO problems4
Optimality conditions for homogeneous polynomial optimization on the unit sphere4
Representation of positive polynomials on a generalized strip and its application to polynomial optimization4
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem4
Symmetric positive subdefinite tensors4
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations4
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming4
Efficient online sensitivity analysis for the injective bottleneck path problem4
Practical algorithm for minimum cost submodular cover problem with performance guarantees4
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach4
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools4
Optimal TSP tour length estimation using Sammon maps3
The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors3
A decomposition algorithm for distributionally robust chance-constrained programs with polyhedral ambiguity set3
A general VNS for the multi-depot open vehicle routing problem with time windows3
Predict and optimize: a smart inventory management model for beauty retail3
Improvement of convergence criteria for finding common fixed points of multiple finite demicontractive mappings3
A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization3
Circumcentric directions of cones3
Convergence theorems of hybrid projection algorithms with two inertial terms for solving fixed point problem3
Functions and inequalities associated with the nonconvex second-order cone3
Solution methodologies for minimizing a sum of pointwise minima of two functions3
An inventory model for multiple items assuming time-varying demands and limited storage3
A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem3
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems3
Policies for multi-trip route planning in time-sensitive environments3
A generalized Frank–Wolfe method with “dual averaging” for strongly convex composite optimization3
A monotonic optimization approach to mixed variational inequality problems3
Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect3
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups3
A generalised λ-Core concept for normal form games3
On the linear convergence rate of Riemannian proximal gradient method3
Linear adjustable robust optimization problem: semidefinite programming reformulation, optimality conditions and duality3
A deep reinforcement learning framework for solving two-stage stochastic programs3
Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation3
On the diameter of a 2-sum of polyhedra3
Optimal step length for the maximal decrease of a self-concordant function by the Newton method3
A hybrid acceleration Douglas-Rachford splitting method for solving large-scale absolute value equations3
The semiproximal SVM approach for multiple instance learning: a kernel-based computational study3
Solving the probabilistic profitable tour problem on a line2
An uncertain minimization problem: robust optimization versus optimization of robustness2
Exact separation theorem for disjoint closed sets in Hilbert spaces2
New smooth weighted complementarity functions and a cubically convergent method for wLCP2
Complexity bound of a Levenberg–Marquardt algorithm based on probabilistic Jacobian models2
An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance2
A comprehensive theoretical framework for the optimization of neural networks classification performance with respect to weighted metrics2
An exact explicit dual for the linear copositive programming problem2
Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points2
A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem2
An optimization approach to coalition formation in centralized EOQ problems with additive transportation costs2
Determining optimal channel partition for 2:4 fine grained structured sparsity2
Scheduling coupled tasks on parallel identical machines2
On the proximal mapping for multi-valued monotone variational inequality problems2
The forward–backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces2
Tensor denoising via dual Schatten norms2
On atomic cliques in temporal graphs2
Mixed-integer linearity in nonlinear optimization: a trust region approach2
A closed-form bound on the asymptotic linear convergence of iterative methods via fixed point analysis2
A VNS based framework for early diagnosis of the Alzheimer's disease converted from mild cognitive impairment2
Local error bounds for the generalized polynomial complementarity problem2
Fractional absolute value equations2
Approximate properly solutions of constrained vector optimization with variable coradiant sets2
The singularity degree of a face of the cone of copositive matrices2
Mixed lattice structures and cone projections2
Practical approximation algorithms for $${\ell}_1$$-regularized sparse rank-1 approximation to higher-order tensors2
Structured $$(\min ,+)$$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems2
Goldstein stationarity in Lipschitz constrained optimization2
Rates of asymptotic regularity for the alternating Halpern–Mann iteration2
On the weak and strong convergence of modified forward-backward-half-forward splitting methods2
Worst-case evaluation complexity of a derivative-free quadratic regularization method2
The multi-depot k-traveling repairman problem2
Feature selection in machine learning via variable neighborhood search2
A note on the hierarchical multi-switch multi-echelon vehicle routing problem2
A modification of the forward–backward splitting method for monotone inclusions2
On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems2
Absolute value equations with $$2^n$$ solutions2
Does risk aversion decrease the order quantity?2
Structure of solutions to a class of multistage stochastic linear complementarity problems2
Biased random-key genetic algorithms for the minimum subgraph diameter problem2
Linear convergence of the proximal gradient method for composite optimization under the Polyak-Łojasiewicz inequality and its variant2
Degree sequence optimization in bounded treewidth2
Trigonometric approximation of the Max-Cut polytope is star-like2
Absolute value inequalities2
Nicely structured positive bases with maximal cosine measure2
A linearized method for solving tensor complementarity problems with implicit Z-tensors2
Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $$\ell _\infty$$-norm objectives2
A folding preprocess for the max k-cut problem2
Minimizing the influence spread over a network through node interception2
Method for finding solution to “quasidifferentiable” differential inclusion2
Hybrid strategy in multiperiod mean-variance framework1
An accelerated lyapunov function for Polyak’s Heavy-ball on convex quadratics1
Hausdorff continuity of solution maps to equilibrium problems via the oriented distance function1
Learning to deactivate probing with graph convolutional network for mixed-integer nonlinear programming1
A note on overrelaxation in the Sinkhorn algorithm1
New second-order limiting directional derivatives and C$$^1$$-optimization1
A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem1
Bregman circumcenters: monotonicity and forward weak convergence1
Conveyor operations in distribution centers: modeling and optimization1
Validation of scenario generation for decision-making using machine learning prediction models1
Subdifferentials of convex matrix-valued functions1
Characterizations of the solution set for tangentially convex optimization problems1
Regularization of vector equilibrium problems1
The truck–drone routing optimization problem: mathematical model and a VNS approach1
Strengthened MIP formulations for the liver region redesign models of Akshat et al.1
A bilevel critical node detection problem1
Two-agent single-machine scheduling with release dates to minimize the makespan1
General variable neighborhood search for the parallel machine scheduling problem with two common servers1
On maximal and minimal elements for sets with respect to cones1
A new feasible moving ball projection algorithm for pseudomonotone variational inequalities1
Lower complexity bounds for minimizing regularized functions1
Benchmark-based deviation and drawdown measures in portfolio optimization1
Globally solving a class of bilevel programs with spatial price equilibrium constraints1
Log-domain interior-point methods for convex quadratic programming1
On proper minimality in set optimization1
Douglas-Rachford splitting algorithm for projected solution of quasi variational inequality with non-self constraint map1
The maximal angle between $$3 \times 3$$ copositive matrices1
The randomized block coordinate descent method in the Hölder smooth setting1
Local linear convergence of proximal coordinate descent algorithm1
Numerical solution of delay fractional optimal control problems with free terminal time1
Distributionally robust joint chance-constrained support vector machines1
Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms1
The set partitioning problem in a quantum context1
On the new modulus-based matrix splitting method for linear complementarity problem of $$H_{+}$$-matrix1
Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping1
Metric perturbation of Milyutin-type regularity and application to cyclic fixed point theorems1
Computing tighter bounds on the n-queens constant via Newton’s method1
Merton portfolio allocation under stochastic dividends1
Individual and cooperative portfolio optimization as linear program1
A cutting plane algorithm for globally solving low-dimensional k-means problems1
Constrained optimization based adversarial example generation for transfer attacks in network intrusion detection systems1
A faster heuristic for the traveling salesman problem with drone1
Robustness of solutions to the capacitated facility location problem with uncertain demand1
Convergence rates of damped inerial dynamics from multi-degree-of-freedom system1
Convergence rates of training deep neural networks via alternating minimization methods1
A discrete competitive facility location model with proportional and binary rules sequentially applied1
Optimal control for production inventory of uncertain random system with jump and deteriorating items1
A projected splitting method for vertical tensor complementarity problems1
Modeling the spread of infectious diseases through influence maximization1
Proximal gradient methods with inexact oracle of degree q for composite optimization1
Some worst-case results related to the asymmetric traveling salesman problem1
Counter-adversarial training data distribution validation1
Mathematical formulations for the robust bin packing problem with fragile objects1
Approximation algorithms for the restricted k-Chinese postman problems with penalties1
Extension of the value function reformulation to multiobjective bilevel optimization1
On a new simple algorithm to compute the resolvents1
A polytime preprocess algorithm for the maximum independent set problem1
On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms1
On sparse solution of tensor complementarity problem1
Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties1
Hausdorff continuity conditions for parametric nonconvex equilibrium problems1
A randomized sketching trust-region secant method for low-memory dynamic optimization1
Buffered and Reduced Multidimensional Distribution Functions and Their Application in Optimization1
Characterization of set-valued robustness via extended signed distances and separation1
Kernel $$\ell ^1$$-norm principal component analysis for denoising1
On maximum-sum matchings of bichromatic points1
The rendezvous vehicle routing problem1
Robust inventory problem with budgeted cumulative demand uncertainty1
The Chambolle–Pock method converges weakly with $$\theta >1/2$$ and $$\tau \sigma \Vert L\Vert ^2<4/(1+2\theta )$$1
A proximal alternating direction method of multipliers with a proximal-perturbed Lagrangian function for nonconvex and nonsmooth structured optimization1
0.23850512504578