OOIR: Observatory of International Research

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-08-01 to 2025-08-01.)

Article	Citations
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, 2020	24
Cooperative congestion games: existence of a Nash-stable coalition structure	21
Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set	21
Constrained many-to-many point matching in two dimensions	17
A Riemannian subspace BFGS trust region method	15
Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization	14
Comparing voting districts with uncertain data envelopment analysis	13
Integrated optimization of design and production process with personalization level of products	12
A distributional Farkas’ lemma and moment optimization problems with no-gap dual semi-definite programs	11
Guillotine cutting is asymptotically optimal for packing consecutive squares	11
On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes	10
On efficient algorithms for bottleneck path problems with many sources	10
Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit	10
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems	10
Pareto efficiency without topology	10
A simplified treatment of Ramana’s exact dual for semidefinite programming	9
An improved algorithm for parallel machine scheduling under additional resource constraints	9
On the least square prenucleolus for games with externalities	9
Branch-and-bound-and-memorize for the blocking permutation flowshop problem	9
On ambiguity-averse market equilibrium	9
Uniqueness of solutions in multivariate Chebyshev approximation problems	9
A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights	8
Higher-order optimality conditions of robust Benson proper efficient solutions in uncertain vector optimization problems	8
Using regression models to understand the impact of route-length variability in practical vehicle routing	8
A global optimization approach to Berge equilibrium based on a regularized function	8

A new convergence rate of the steepest descent regarding the Euclidean norm	8
Improved exploitation of higher order smoothness in derivative-free optimization	8
Linear convergence rate analysis of proximal generalized ADMM for convex composite programming	7
A conditional-logic interpretation for Miller–Tucker–Zemlin inequalities and extensions	7
The multilevel facility location and pricing problems: the computational complexity and the stability analysis	7
A computational study on QP problems with general linear constraints	7
Cooperation in combinatorial search	7
A general variable neighborhood search approach for the minimum load coloring problem	7
Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces	7
Well-posedness for the split equilibrium problem	7
Convergence rate analysis of proximal iteratively reweighted $$\ell _1$$ methods for $$\ell _p$$ regularization problems	7
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times	7
Stochastic saddle-point optimization for the Wasserstein barycenter problem	7
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost	6
A maximal-clique-based set-covering approach to overlapping community detection	6
A gradient method exploiting the two dimensional quadratic termination property	6
Frugal and decentralised resolvent splittings defined by nonexpansive operators	6
On linear algebraic algorithms for the subgraph matching problem and its variants	6
Generator subadditive functions for mixed-integer programs	5
A no-delay single machine scheduling problem to minimize total weighted early and late work	5
Differentially private k-center problems	5
Convergence rates analysis of a multiobjective proximal gradient method	5
Hybrid variable neighborhood search for automated warehouse scheduling	5
The budgeted maximin share allocation problem	5
A new restricted memory level bundle method for constrained convex nonsmooth optimization	5
A metaheuristic algorithm for efficient aircraft sequencing and scheduling in terminal maneuvering areas	5
Strategy investments in zero-sum games	5
The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis	5
A Non-polyhedral extension of the Frank–Wolfe theorem to cubic optimization	5
General variable neighborhood search for the minimum stretch spanning tree problem	5
Sparse and risk diversification portfolio selection	5
Convergence of a special partially augmented Lagrangian algorithm for sparsity-constrained optimization problems	5
On coupling constraints in linear bilevel optimization	4
Greedy Newton: Newton’s method with exact line search	4
Polyhedral results and stronger Lagrangean bounds for stable spanning trees	4
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem	4
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems	4
Optimality conditions for homogeneous polynomial optimization on the unit sphere	4
Expansions of the characteristic polynomial of a perturbed PSD matrix and convergence analysis of alternating projections for the PSD cone and a line	4
Spatial branching for a special class of convex MIQO problems	4
2DPackLib: a two-dimensional cutting and packing library	4
A study on the impact of selecting the follower’s reaction in solving semi-vectorial bilevel problems	4
On an effective approach in shape optimization problem for Stokes equation	4
Wildfire burn scar encapsulation	4
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization	4
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations	4
Representation of positive polynomials on a generalized strip and its application to polynomial optimization	4
An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c	4
Stability approach to CDC truck scheduling problem under uncertainty	4
Efficient online sensitivity analysis for the injective bottleneck path problem	4

Optimal externalities in a parallel transportation network	4
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints	4
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach	4
Matching orderable and separable hypergraphs	4
Existence of the least element solution of the vertical block Z-tensor complementarity problem	4
Online total bipartite matching problem	4
Optimality conditions for robust weakly efficient solutions in uncertain optimization	4
A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem	3
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems	3
A strict complementarity approach to error bound and sensitivity of solution of conic programs	3
Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation	3
Optimal TSP tour length estimation using Sammon maps	3
Scheduling coupled tasks on parallel identical machines	3
The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors	3
Policies for multi-trip route planning in time-sensitive environments	3
On penalized reload cost path, walk, tour and maximum flow: hardness and approximation	3
A linearized method for solving tensor complementarity problems with implicit Z-tensors	3
A general VNS for the multi-depot open vehicle routing problem with time windows	3
Optimal step length for the maximal decrease of a self-concordant function by the Newton method	3
Predict and optimize: a smart inventory management model for beauty retail	3
The metric projection over a polyhedral set through the relative interiors of its faces	3
Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds	3
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups	3
Practical algorithm for minimum cost submodular cover problem with performance guarantees	3
Mixed-integer linear optimization for cardinality-constrained random forests	3
The semiproximal SVM approach for multiple instance learning: a kernel-based computational study	3
Determining optimal channel partition for 2:4 fine grained structured sparsity	3
On the weak and strong convergence of modified forward-backward-half-forward splitting methods	3
Solution methodologies for minimizing a sum of pointwise minima of two functions	3
Convergence theorems of hybrid projection algorithms with two inertial terms for solving fixed point problem	3
A deep reinforcement learning framework for solving two-stage stochastic programs	3
A hybrid acceleration Douglas-Rachford splitting method for solving large-scale absolute value equations	3
A generalized Frank–Wolfe method with “dual averaging” for strongly convex composite optimization	3
Improvement of convergence criteria for finding common fixed points of multiple finite demicontractive mappings	3
A note: on the two-stage flowshop with dedicated machines to minimize total load	3
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools	3
Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect	3
Dual and generalized dual cones in Banach spaces	3
Duality in the problems of optimal control described by Darboux-type differential inclusions	3
Circumcentric directions of cones	3
Practical approximation algorithms for $${\ell}_1$$-regularized sparse rank-1 approximation to higher-order tensors	3
A decomposition algorithm for distributionally robust chance-constrained programs with polyhedral ambiguity set	3
An inventory model for multiple items assuming time-varying demands and limited storage	3
On the linear convergence rate of Riemannian proximal gradient method	3
On the diameter of a 2-sum of polyhedra	3
A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization	3
A monotonic optimization approach to mixed variational inequality problems	3
Symmetric positive subdefinite tensors	3
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming	3