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-11-01 to 2025-11-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	25
Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set	25
Cooperative congestion games: existence of a Nash-stable coalition structure	25
Constrained many-to-many point matching in two dimensions	18
A Riemannian subspace BFGS trust region method	17
Integrated optimization of design and production process with personalization level of products	17
Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization	15
Comparing voting districts with uncertain data envelopment analysis	14
A distributional Farkas’ lemma and moment optimization problems with no-gap dual semi-definite programs	13
On efficient algorithms for bottleneck path problems with many sources	12
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems	11
Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit	11
Guillotine cutting is asymptotically optimal for packing consecutive squares	11
On asymptotic global stability of linear variational inequalities in Hilbert space based on Hausdorff convergence	11
A simplified treatment of Ramana’s exact dual for semidefinite programming	10
On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes	10
On ambiguity-averse market equilibrium	10
A new convergence rate of the steepest descent regarding the Euclidean norm	9
On the least square prenucleolus for games with externalities	9
Using regression models to understand the impact of route-length variability in practical vehicle routing	9
Uniqueness of solutions in multivariate Chebyshev approximation problems	9
Branch-and-bound-and-memorize for the blocking permutation flowshop problem	9
A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights	9
A semidefinite hierarchy for the expected independence number of a random graph	8
Pareto efficiency without topology	8

An improved algorithm for parallel machine scheduling under additional resource constraints	8
Improved exploitation of higher order smoothness in derivative-free optimization	8
Stochastic saddle-point optimization for the Wasserstein barycenter problem	7
A global optimization approach to Berge equilibrium based on a regularized function	7
Higher-order optimality conditions of robust Benson proper efficient solutions in uncertain vector optimization problems	7
Linear convergence rate analysis of proximal generalized ADMM for convex composite programming	7
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times	7
A gradient projection algorithm based on the normal-S iterative algorithm: convergence analysis and machine learning application	7
Cooperation in combinatorial search	7
A general variable neighborhood search approach for the minimum load coloring problem	6
A conditional-logic interpretation for Miller–Tucker–Zemlin inequalities and extensions	6
On linear algebraic algorithms for the subgraph matching problem and its variants	6
The multilevel facility location and pricing problems: the computational complexity and the stability analysis	6
The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis	6
A computational study on QP problems with general linear constraints	6
Convergence rate analysis of proximal iteratively reweighted $$\ell _1$$ methods for $$\ell _p$$ regularization problems	6
Well-posedness for the split equilibrium problem	6
A Non-polyhedral extension of the Frank–Wolfe theorem to cubic optimization	6
A gradient method exploiting the two dimensional quadratic termination property	5
The budgeted maximin share allocation problem	5
Strategy investments in zero-sum games	5
Sparse and risk diversification portfolio selection	5
Differentially private k-center problems	5
A no-delay single machine scheduling problem to minimize total weighted early and late work	5
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost	5
Hybrid variable neighborhood search for automated warehouse scheduling	5
Convergence rates analysis of a multiobjective proximal gradient method	5
On coupling constraints in linear bilevel optimization	5
A metaheuristic algorithm for efficient aircraft sequencing and scheduling in terminal maneuvering areas	5
A new restricted memory level bundle method for constrained convex nonsmooth optimization	5
A maximal-clique-based set-covering approach to overlapping community detection	5
Frugal and decentralised resolvent splittings defined by nonexpansive operators	5
An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c	5
Generator subadditive functions for mixed-integer programs	5
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints	4
Duality in the problems of optimal control described by Darboux-type differential inclusions	4
Online total bipartite matching problem	4
Convergence of a special partially augmented Lagrangian algorithm for sparsity-constrained optimization problems	4
Stability approach to CDC truck scheduling problem under uncertainty	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
Polyhedral results and stronger Lagrangean bounds for stable spanning trees	4
Optimal externalities in a parallel transportation network	4
A note: on the two-stage flowshop with dedicated machines to minimize total load	4
A study on the impact of selecting the follower’s reaction in solving semi-vectorial bilevel problems	4
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization	4
Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds	4
Matching orderable and separable hypergraphs	4
A strict complementarity approach to error bound and sensitivity of solution of conic programs	4
Existence of the least element solution of the vertical block Z-tensor complementarity problem	4
Spatial branching for a special class of convex MIQO problems	4

Optimality conditions for homogeneous polynomial optimization on the unit sphere	4
Representation of positive polynomials on a generalized strip and its application to polynomial optimization	4
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems	4
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem	4
Greedy Newton: Newton’s method with exact line search	4
Symmetric positive subdefinite tensors	4
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming	4
Practical algorithm for minimum cost submodular cover problem with performance guarantees	4
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach	4
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools	4
General variable neighborhood search for the minimum stretch spanning tree problem	4
Optimality conditions for robust weakly efficient solutions in uncertain optimization	4
Single-objective robust optimisation in bioprocessing with conformalised quantile regression as interval-based surrogate models	4
On an effective approach in shape optimization problem for Stokes equation	4
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations	4
The metric projection over a polyhedral set through the relative interiors of its faces	4
Efficient online sensitivity analysis for the injective bottleneck path problem	4
Dual and generalized dual cones in Banach spaces	4
On penalized reload cost path, walk, tour and maximum flow: hardness and approximation	4
Mixed-integer linear optimization for cardinality-constrained random forests	4
A hybrid acceleration Douglas-Rachford splitting method for solving large-scale absolute value equations	3
The semiproximal SVM approach for multiple instance learning: a kernel-based computational study	3
Optimal TSP tour length estimation using Sammon maps	3
The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors	3
A decomposition algorithm for distributionally robust chance-constrained programs with polyhedral ambiguity set	3
A general VNS for the multi-depot open vehicle routing problem with time windows	3
Predict and optimize: a smart inventory management model for beauty retail	3
Improvement of convergence criteria for finding common fixed points of multiple finite demicontractive mappings	3
A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization	3
Circumcentric directions of cones	3
Convergence theorems of hybrid projection algorithms with two inertial terms for solving fixed point problem	3
Functions and inequalities associated with the nonconvex second-order cone	3
Solution methodologies for minimizing a sum of pointwise minima of two functions	3
An inventory model for multiple items assuming time-varying demands and limited storage	3
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
Policies for multi-trip route planning in time-sensitive environments	3
A generalized Frank–Wolfe method with “dual averaging” for strongly convex composite optimization	3
A monotonic optimization approach to mixed variational inequality problems	3
Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect	3
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups	3
A generalised λ-Core concept for normal form games	3
On the linear convergence rate of Riemannian proximal gradient method	3
Linear adjustable robust optimization problem: semidefinite programming reformulation, optimality conditions and duality	3
A deep reinforcement learning framework for solving two-stage stochastic programs	3
Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation	3
On the diameter of a 2-sum of polyhedra	3
Optimal step length for the maximal decrease of a self-concordant function by the Newton method	3