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-09-01 to 2025-09-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, 202025
Cooperative congestion games: existence of a Nash-stable coalition structure22
Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set21
Constrained many-to-many point matching in two dimensions17
Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization15
A Riemannian subspace BFGS trust region method15
Integrated optimization of design and production process with personalization level of products13
Comparing voting districts with uncertain data envelopment analysis13
On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes12
Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit12
Guillotine cutting is asymptotically optimal for packing consecutive squares11
Pareto efficiency without topology10
Branch-and-bound-and-memorize for the blocking permutation flowshop problem10
On efficient algorithms for bottleneck path problems with many sources10
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems10
A distributional Farkas’ lemma and moment optimization problems with no-gap dual semi-definite programs10
An improved algorithm for parallel machine scheduling under additional resource constraints10
A simplified treatment of Ramana’s exact dual for semidefinite programming9
A semidefinite hierarchy for the expected independence number of a random graph9
A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights9
On the least square prenucleolus for games with externalities9
On ambiguity-averse market equilibrium9
Uniqueness of solutions in multivariate Chebyshev approximation problems9
Improved exploitation of higher order smoothness in derivative-free optimization8
A new convergence rate of the steepest descent regarding the Euclidean norm8
Using regression models to understand the impact of route-length variability in practical vehicle routing8
Linear convergence rate analysis of proximal generalized ADMM for convex composite programming8
A global optimization approach to Berge equilibrium based on a regularized function8
Higher-order optimality conditions of robust Benson proper efficient solutions in uncertain vector optimization problems8
Cooperation in combinatorial search7
A general variable neighborhood search approach for the minimum load coloring problem7
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
Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces7
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times7
A conditional-logic interpretation for Miller–Tucker–Zemlin inequalities and extensions7
A computational study on QP problems with general linear constraints7
Stochastic saddle-point optimization for the Wasserstein barycenter problem7
On linear algebraic algorithms for the subgraph matching problem and its variants6
Well-posedness for the split equilibrium problem6
A gradient method exploiting the two dimensional quadratic termination property6
A gradient projection algorithm based on the normal-S iterative algorithm: convergence analysis and machine learning application6
Hybrid variable neighborhood search for automated warehouse scheduling5
Generator subadditive functions for mixed-integer programs5
A Non-polyhedral extension of the Frank–Wolfe theorem to cubic optimization5
Sparse and risk diversification portfolio selection5
Frugal and decentralised resolvent splittings defined by nonexpansive operators5
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost5
The budgeted maximin share allocation problem5
Differentially private k-center problems5
A new restricted memory level bundle method for constrained convex nonsmooth optimization5
A maximal-clique-based set-covering approach to overlapping community detection5
The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis5
Convergence rates analysis of a multiobjective proximal gradient method5
Strategy investments in zero-sum games5
A no-delay single machine scheduling problem to minimize total weighted early and late work5
Expansions of the characteristic polynomial of a perturbed PSD matrix and convergence analysis of alternating projections for the PSD cone and a line4
Spatial branching for a special class of convex MIQO problems4
Stability approach to CDC truck scheduling problem under uncertainty4
On coupling constraints in linear bilevel optimization4
2DPackLib: a two-dimensional cutting and packing library4
Wildfire burn scar encapsulation4
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools4
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem4
Optimality conditions for homogeneous polynomial optimization on the unit sphere4
Optimal externalities in a parallel transportation network4
Representation of positive polynomials on a generalized strip and its application to polynomial optimization4
Optimality conditions for robust weakly efficient solutions in uncertain optimization4
An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c4
A metaheuristic algorithm for efficient aircraft sequencing and scheduling in terminal maneuvering areas4
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
Existence of the least element solution of the vertical block Z-tensor complementarity problem4
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization4
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations4
On an effective approach in shape optimization problem for Stokes equation4
Greedy Newton: Newton’s method with exact line search4
Online total bipartite matching problem4
General variable neighborhood search for the minimum stretch spanning tree problem4
Convergence of a special partially augmented Lagrangian algorithm for sparsity-constrained optimization problems4
Efficient online sensitivity analysis for the injective bottleneck path problem4
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems4
A strict complementarity approach to error bound and sensitivity of solution of conic programs4
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints4
Polyhedral results and stronger Lagrangean bounds for stable spanning trees4
Matching orderable and separable hypergraphs4
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming3
Optimal step length for the maximal decrease of a self-concordant function by the Newton method3
Symmetric positive subdefinite tensors3
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach3
Duality in the problems of optimal control described by Darboux-type differential inclusions3
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems3
Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation3
The semiproximal SVM approach for multiple instance learning: a kernel-based computational study3
On the weak and strong convergence of modified forward-backward-half-forward splitting methods3
Solution methodologies for minimizing a sum of pointwise minima of two functions3
Circumcentric directions of cones3
Convergence theorems of hybrid projection algorithms with two inertial terms for solving fixed point problem3
Policies for multi-trip route planning in time-sensitive environments3
A deep reinforcement learning framework for solving two-stage stochastic programs3
On the diameter of a 2-sum of polyhedra3
The metric projection over a polyhedral set through the relative interiors of its faces3
On penalized reload cost path, walk, tour and maximum flow: hardness and approximation3
A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem3
Practical algorithm for minimum cost submodular cover problem with performance guarantees3
Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds3
An inventory model for multiple items assuming time-varying demands and limited storage3
Scheduling coupled tasks on parallel identical machines3
On the linear convergence rate of Riemannian proximal gradient method3
A decomposition algorithm for distributionally robust chance-constrained programs with polyhedral ambiguity set3
A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization3
A monotonic optimization approach to mixed variational inequality problems3
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
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
Dual and generalized dual cones in Banach spaces3
Optimal TSP tour length estimation using Sammon maps3
Improvement of convergence criteria for finding common fixed points of multiple finite demicontractive mappings3
The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors3
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
A hybrid acceleration Douglas-Rachford splitting method for solving large-scale absolute value equations3
0.1616199016571