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

Article	Citations
A fresh geometrical look at the general S-procedure	31
An approximation algorithm for the k-generalized Steiner forest problem	19
Primal-dual subgradient method for constrained convex optimization problems	18
On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes	17
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	15
On sparse solution of tensor complementarity problem	15
Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs	13
Online NDP-constraint scheduling of jobs with delivery times or weights	13
The set partitioning problem in a quantum context	12
A polytime preprocess algorithm for the maximum independent set problem	12
A distributional Farkas’ lemma and moment optimization problems with no-gap dual semi-definite programs	12
On efficient algorithms for bottleneck path problems with many sources	11
Strong convergence of inertial subgradient extragradient algorithm for solving pseudomonotone equilibrium problems	11
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem	10
Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights	10
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints	10
Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties	10
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach	9
Nested-solution facility location models	9
On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces	8
Shortest path network problems with stochastic arc weights	8
Optimization of boundary value problems for higher order differential inclusions and duality	8
Tight bounds on Lyapunov rank	8
Matching orderable and separable hypergraphs	8
Designing an optimal contract mechanism in a cellulosic biofuel enterprise	8

On lower and upper bounds for single machine parallel batch scheduling	8
Review on the book Anatoly Zhigljavsky, Antanas Žilinskas “Bayesian and High-Dimensional Global Optimization”, SpringerBriefs in Optimization, Springer, 2021	8
t-Linearization for the maximum diversity problem	8
Optimal externalities in a parallel transportation network	7
A note on approximate proper efficiency in linear fractional vector optimization	7
A strict complementarity approach to error bound and sensitivity of solution of conic programs	7
Efficient compact linear programs for network revenue management	7
Connectedness of the solution sets in generalized semi-infinite set optimization	7
A class of new modulus-based matrix splitting methods for linear complementarity problem	7
Zeroth-order methods for noisy Hölder-gradient functions	7
Nonsmooth rank-one matrix factorization landscape	7
Optimality conditions for homogeneous polynomial optimization on the unit sphere	7
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations	7
Constrained optimization based adversarial example generation for transfer attacks in network intrusion detection systems	7
A low-rank spectral method for learning Markov models	7
Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions	7
Computing tighter bounds on the n-queens constant via Newton’s method	7
A step-truncated method in a wide neighborhood interior-point algorithm for linear programming	7
A unified analysis of convex and non-convex $$\ell _p$$-ball projection problems	7
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools	6
On an effective approach in shape optimization problem for Stokes equation	6
Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form	6
Minimizing the influence spread over a network through node interception	6
Subdifferentials of convex matrix-valued functions	6
Comparing voting districts with uncertain data envelopment analysis	6
Feature selection in machine learning via variable neighborhood search	6
The truck–drone routing optimization problem: mathematical model and a VNS approach	6
Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization	6
A modification of the forward–backward splitting method for monotone inclusions	6
A novel one-parameter filled function method with an application to pathological analysis	6
Dependence in constrained Bayesian optimization	6
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems	6
Decentralized bilevel optimization	6
General variable neighborhood search approach to group steiner tree problem	5
An uncertain minimization problem: robust optimization versus optimization of robustness	5
A Riemannian subspace BFGS trust region method	5
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems	5
Method for finding solution to “quasidifferentiable” differential inclusion	5
Regularization of vector equilibrium problems	5
Kernel $$\ell ^1$$-norm principal component analysis for denoising	5
Polyhedral results and stronger Lagrangean bounds for stable spanning trees	5
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization	5
Tensor denoising via dual Schatten norms	5
Integrated optimization of design and production process with personalization level of products	5
On maximal and minimal elements for sets with respect to cones	4
The metric projection over a polyhedral set through the relative interiors of its faces	4
Dynamic resource allocation and collaborative scheduling in R&D and manufacturing processes of high-end equipment with budget constraint	4
Guillotine cutting is asymptotically optimal for packing consecutive squares	4
Decentralized scheduling with precedence constraints	4
Theoretical analysis of integer programming models for the two-dimensional two-staged knapsack problem	4

Single machine scheduling with maintenance and position-based job eligibility constraints for battery manufacturing	4
Expected value based optimal control for discrete-time stochastic noncausal systems	4
Spatial price equilibrium networks with flow-dependent arc multipliers	4
Minimum budget for misinformation detection in online social networks with provable guarantees	4
Review on the book Yaroslav D. Sergeyev, Renato De Leone (Eds.) Numerical infinities and infinitesimals in optimization	4
Optimal override policy for chemotherapy scheduling template via mixed-integer linear programming	4
A link between the steepest descent method and fixed-point iterations	4
The multi-depot k-traveling repairman problem	4
Wildfire burn scar encapsulation	4
Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications	4
Optimal step length for the maximal decrease of a self-concordant function by the Newton method	4
Correction to: A no-delay single machine scheduling problem to minimize total weighted early and late work	4
A deep reinforcement learning framework for solving two-stage stochastic programs	4
Equilibrium uniqueness in aggregative games: very practical conditions	4
Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set	4
Constrained many-to-many point matching in two dimensions	4
A block coordinate descent method for sensor network localization	4
Cooperative congestion games: existence of a Nash-stable coalition structure	4
A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation	3
Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect	3
Pareto efficiency without topology	3
Regularized quasi-monotone method for stochastic optimization	3
Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models	3
An improved algorithm for parallel machine scheduling under additional resource constraints	3
A note on Anti-Nash equilibrium for bimatrix game	3
Bin packing with divisible item sizes and rejection penalties	3
Using regression models to understand the impact of route-length variability in practical vehicle routing	3
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups	3
Dual and generalized dual cones in Banach spaces	3
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems	3
Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions	3
A general VNS for the multi-depot open vehicle routing problem with time windows	3
Log-domain interior-point methods for convex quadratic programming	3
Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem	3
Circumcentric directions of cones	3
Robustness of solutions to the capacitated facility location problem with uncertain demand	3
On ambiguity-averse market equilibrium	3
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program	3
Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation	3
Approximation algorithms for the k-depots Hamiltonian path problem	3
On refinement strategies for solving $${\textsc {MINLP}\mathrm{s}}$$ by piecewise linear relaxations: a generalized red refinement	3
Convergence of Lasserre’s hierarchy: the general case	3
Implicit steepest descent algorithm for optimization with orthogonality constraints	3
A generalized Frank–Wolfe method with “dual averaging” for strongly convex composite optimization	3
Practical initialization of the Nelder–Mead method for computationally expensive optimization problems	3
Lower bounds of the solution set of the polynomial complementarity problem	3
A discrete competitive facility location model with proportional and binary rules sequentially applied	3
Optimal TSP tour length estimation using Sammon maps	3
A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights	3
Existence and generic stability conditions of equilibrium points to controlled systems for n-player multiobjective generalized games using the Kakutani–Fan–Glicksberg fixed-point theorem	3
Gain-optimized spectral distortions for pronunciation training	3
On partial descriptions of König graphs for odd paths and all their spanning supergraphs	3
On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression	3
On properties of univariate max functions at local maximizers	3
Improved exploitation of higher order smoothness in derivative-free optimization	3