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 2022-06-01 to 2026-06-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	33
Constrained many-to-many point matching in two dimensions	22
A Riemannian subspace BFGS trust region method	19
Integrated optimization of design and production process with personalization level of products	19
Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization	14
Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit	13
Comparing voting districts with uncertain data envelopment analysis	13
On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes	12
A distributional Farkas’ lemma and moment optimization problems with no-gap dual semi-definite programs	12
Stiefel optimization is NP-hard	12
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems	12
An exact penalty method for group-sparse portfolio selection	12
On efficient algorithms for bottleneck path problems with many sources	11
On the uniqueness of Nash equilibria in polymatrix games	10
Uniqueness of solutions in multivariate Chebyshev approximation problems	10
On asymptotic global stability of linear variational inequalities in Hilbert space based on Hausdorff convergence	10
A simplified treatment of Ramana’s exact dual for semidefinite programming	10
A new convergence rate of the steepest descent regarding the Euclidean norm	9
A semidefinite hierarchy for the expected independence number of a random graph	9
On the least square prenucleolus for games with externalities	9
Pareto efficiency without topology	9
A global optimization approach to Berge equilibrium based on a regularized function	8
An improved algorithm for parallel machine scheduling under additional resource constraints	8
Well-posedness for the split equilibrium problem	8
On ambiguity-averse market equilibrium	8

Linear convergence rate analysis of proximal generalized ADMM for convex composite programming	8
Branch-and-bound-and-memorize for the blocking permutation flowshop problem	8
Cooperation in combinatorial search	7
Convergence rate analysis of proximal iteratively reweighted $$\ell _1$$ methods for $$\ell _p$$ regularization problems	7
A gradient projection algorithm based on the normal-S iterative algorithm: convergence analysis and machine learning application	7
Higher-order optimality conditions of robust Benson proper efficient solutions in uncertain vector optimization problems	7
The multilevel facility location and pricing problems: the computational complexity and the stability analysis	7
A conditional-logic interpretation for Miller–Tucker–Zemlin inequalities and extensions	7
Stability for set optimization problems and applications	7
Approximating the order 2 quantum Wasserstein distance using the moment-SOS hierarchy	7
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times	6
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost	6
A Non-polyhedral extension of the Frank–Wolfe theorem to cubic optimization	6
On linear algebraic algorithms for the subgraph matching problem and its variants	6
A unified tool for solving uni-parametric linear programs, convex quadratic programs, and linear complementarity problems	6
The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis	6
A gradient method exploiting the two dimensional quadratic termination property	6
The budgeted maximin share allocation problem	6
Generator subadditive functions for mixed-integer programs	6
A study on the impact of selecting the follower’s reaction in solving semi-vectorial bilevel problems	5
Representation of positive polynomials on a generalized strip and its application to polynomial optimization	5
Convergence of a special partially augmented Lagrangian algorithm for sparsity-constrained optimization problems	5
An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c	5
Improved conditional gradient method for the generalized cone order optimization problem on the local sphere	5
A maximal-clique-based set-covering approach to overlapping community detection	5
Single-objective robust optimisation in bioprocessing with conformalised quantile regression as interval-based surrogate models	5
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems	5
Expansions of the characteristic polynomial of a perturbed PSD matrix and convergence analysis of alternating projections for the PSD cone and a line	5
Greedy Newton: Newton’s method with exact line search	5
Efficient online sensitivity analysis for the injective bottleneck path problem	5
Sparse and risk diversification portfolio selection	5
Strategy investments in zero-sum games	5
Approximation algorithm for the fault-tolerant knapsack center problem	5
Differentially private k-center problems	5
Spatial branching for a special class of convex MIQO problems	5
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations	5
Existence of the least element solution of the vertical block Z-tensor complementarity problem	5
Optimality conditions for robust weakly efficient solutions in uncertain optimization	5
General variable neighborhood search for the minimum stretch spanning tree problem	5
Hybrid variable neighborhood search for automated warehouse scheduling	5
Frugal and decentralised resolvent splittings defined by nonexpansive operators	5
On coupling constraints in linear bilevel optimization	5
Stability approach to CDC truck scheduling problem under uncertainty	5
A metaheuristic algorithm for efficient aircraft sequencing and scheduling in terminal maneuvering areas	5
Recovering linear causal models with latent variables via Cholesky factorization of covariance matrix	5
Optimality conditions for homogeneous polynomial optimization on the unit sphere	4
The semiproximal SVM approach for multiple instance learning: a kernel-based computational study	4
On penalized reload cost path, walk, tour and maximum flow: hardness and approximation	4
Policies for multi-trip route planning in time-sensitive environments	4
On an effective approach in shape optimization problem for Stokes equation	4

A strict complementarity approach to error bound and sensitivity of solution of conic programs	4
Polyhedral results and stronger Lagrangean bounds for stable spanning trees	4
Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds	4
Predict and optimize: a smart inventory management model for beauty retail	4
Dual and generalized dual cones in Banach spaces	4
The metric projection over a polyhedral set through the relative interiors of its faces	4
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem	4
Enhancing finite-difference-based derivative-free optimization with machine learning	4
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools	4
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization	4
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming	4
Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect	4
A monotonic optimization approach to mixed variational inequality problems	4
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints	4
Mixed-integer linear optimization for cardinality-constrained random forests	4
Nonnegative low-rank matrix recovery can have spurious local minima	4
A hybrid acceleration Douglas-Rachford splitting method for solving large-scale absolute value equations	3
Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation	3
A note: on the two-stage flowshop with dedicated machines to minimize total load	3
Convergence theorems of hybrid projection algorithms with two inertial terms for solving fixed point problem	3
Improvement of convergence criteria for finding common fixed points of multiple finite demicontractive mappings	3
A decomposition algorithm for distributionally robust chance-constrained programs with polyhedral ambiguity set	3
Scheduling coupled tasks on parallel identical machines	3
Circumcentric directions of cones	3
A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem	3
Optimal step length for the maximal decrease of a self-concordant function by the Newton method	3
A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization	3
Duality in the problems of optimal control described by Darboux-type differential inclusions	3
A generalized Frank–Wolfe method with “dual averaging” for strongly convex composite optimization	3
Convergence of the sum-of-squares hierarchy for quadratic optimization over roots-of-unity	3
On the weak and strong convergence of modified forward-backward-half-forward splitting methods	3
A generalised λ-Core concept for normal form games	3
Linear adjustable robust optimization problem: semidefinite programming reformulation, optimality conditions and duality	3
Optimal TSP tour length estimation using Sammon maps	3
Symmetric positive subdefinite tensors	3
Practical algorithm for minimum cost submodular cover problem with performance guarantees	3
On the diameter of a 2-sum of polyhedra	3
Resolving an open problem: maximizing the total irregularity index of molecular trees with prescribed segments or branching vertices	3
A deep reinforcement learning framework for solving two-stage stochastic programs	3
Functions and inequalities associated with the nonconvex second-order cone	3
A linearized method for solving tensor complementarity problems with implicit Z-tensors	3
On the linear convergence rate of Riemannian proximal gradient method	3
Trust and reputation systems in cloud data centers: a variational approach	3
A general VNS for the multi-depot open vehicle routing problem with time windows	3