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 2020-05-01 to 2024-05-01.)

Article	Citations
New inertial relaxed method for solving split feasibilities	50
The Big-M method with the numerical infinite M	48
Explicit extragradient-like method with adaptive stepsizes for pseudomonotone variational inequalities	21
A class of new modulus-based matrix splitting methods for linear complementarity problem	19
On the unique solution of the generalized absolute value equation	18
On the convergence rate of the Halpern-iteration	18
Personnel scheduling during Covid-19 pandemic	18
Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights	17
A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem	16
Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints	16
The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects	15
An inertial Popov’s method for solving pseudomonotone variational inequalities	15
A note on partial calmness for bilevel optimization problems with linearly structured lower level	14
Closing the gap in linear bilevel optimization: a new valid primal-dual inequality	13
Approximation algorithms for the multiprocessor scheduling with submodular penalties	13
Mathematical optimization approach for facility layout on several rows	13
Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem	12
Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules	12
Mathematical formulations and improvements for the multi-depot open vehicle routing problem	11
A new concave minimization algorithm for the absolute value equation solution	11
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation	11
Modeling the spread of infectious diseases through influence maximization	11
A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order	11
Edge metric dimensions via hierarchical product and integer linear programming	11
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming	10

A new DIRECT-GLh algorithm for global optimization with hidden constraints	10
Modeling a flexible staff scheduling problem in the Era of Covid-19	10
Proximal operator and optimality conditions for ramp loss SVM	10
Convergence rates analysis of a multiobjective proximal gradient method	10
Minimum budget for misinformation detection in online social networks with provable guarantees	9
Aggregate subgradient method for nonsmooth DC optimization	9
A dynamic programming algorithm for solving the k-Color Shortest Path Problem	9
Vector network equilibrium problems with uncertain demands and capacity constraints of arcs	9
Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces	8
On the Burer–Monteiro method for general semidefinite programs	8
On the convergence of algorithms with Tikhonov regularization terms	8
Gain-optimized spectral distortions for pronunciation training	8
Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects	8
Resolvent of the parallel composition and the proximity operator of the infimal postcomposition	8
Exact approaches for competitive facility location with discrete attractiveness	8
Green supply chain design with emission sensitive demand: second order cone programming formulation and case study	8
2DPackLib: a two-dimensional cutting and packing library	7
Complexity of near-optimal robust versions of multilevel optimization problems	7
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	7
Two-Bar Charts Packing Problem	7
An efficient heuristic for a hub location routing problem	7
A resiliency analysis of information distribution policies over mobile ad hoc networks	7
Games with distributionally robust joint chance constraints	7
Online algorithms for the mixed ring loading problem with two nodes	7
Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance	7
Practical initialization of the Nelder–Mead method for computationally expensive optimization problems	7
Convergence of Lasserre’s hierarchy: the general case	7
A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations	6
Bounds of the solution set of the tensor complementarity problem	6
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups	6
Zeroth-order methods for noisy Hölder-gradient functions	6
A new model for curriculum-based university course timetabling	6
Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data	6
On quantitative stability in infinite-dimensional optimization under uncertainty	6
Strong convergence of inertial subgradient extragradient algorithm for solving pseudomonotone equilibrium problems	6
Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach	6
A deterministic algorithm to compute the cosine measure of a finite positive spanning set	6
Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location	6
Spatial price equilibrium networks with flow-dependent arc multipliers	6
Distributionally robust joint chance-constrained support vector machines	5
Unified linear convergence of first-order primal-dual algorithms for saddle point problems	5
On periodic solution to control problem with time-driven switching	5
A randomized heuristic repair for the multidimensional knapsack problem	5
Numerical solution of delay fractional optimal control problems with free terminal time	5
Implicit steepest descent algorithm for optimization with orthogonality constraints	5
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach	5
On lattice point counting in $$\varDelta $$-modular polyhedra	5
Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping	5
A parallel variable neighborhood search for solving covering salesman problem	5
Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates	5

Strong Karush–Kuhn–Tucker optimality conditions for weak efficiency in constrained multiobjective programming problems in terms of mordukhovich subdifferentials	5
Computationally efficient approach for solving lexicographic multicriteria optimization problems	5
Vehicle routing problem considering equity of demand satisfaction	5
Minsum scheduling with acceptable lead-times and optional job rejection	5
Improved analysis of spectral algorithm for clustering	5
QN-tensor and tensor complementarity problem	5
Analytic solution of the continuous particle swarm optimization problem	5
Greedy approximation for the minimum connected dominating set with labeling	5
Strong convergence theorems for inertial Tseng’s extragradient method for solving variational inequality problems and fixed point problems	4
Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem	4
Stability analysis for set-valued equilibrium problems with applications to Browder variational inclusions	4
On the computational complexity of uncapacitated multi-plant lot-sizing problems	4
The moment-SOS hierarchy and the Christoffel–Darboux kernel	4
Some notes on the solvability conditions for absolute value equations	4
A covering traveling salesman problem with profit in the last mile delivery	4
The quasidifferential descent method in a control problem with nonsmooth objective functional	4
An effective version of Schmüdgen’s Positivstellensatz for the hypercube	4
Homogeneous polynomials and spurious local minima on the unit sphere	4
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems	4
On the new modulus-based matrix splitting method for linear complementarity problem of $$H_{+}$$-matrix	4
Optimization approach to Berge equilibrium for bimatrix game	4
On the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization	4
Improved lower bound on the dimension of the EU council’s voting rules	4
The assignment problem revisited	4
On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space	4
A descent extension of a modified Polak–Ribière–Polyak method with application in image restoration problem	4
Sample average approximations of strongly convex stochastic programs in Hilbert spaces	4
On self-concordant barriers for generalized power cones	4
A matrix-free trust-region newton algorithm for convex-constrained optimization	4
Commutation principles for optimization problems on spectral sets in Euclidean Jordan algebras	4
The multi-depot k-traveling repairman problem	4
Approximating the product knapsack problem	4
The single train shortest route problem in a railyard	4
On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression	4
On solving the order processing in picking workstations	3
Inverse integer optimization with multiple observations	3
Less is more approach in optimization: a road to artificial intelligence	3
A note on the hierarchical multi-switch multi-echelon vehicle routing problem	3
Efficient nearest neighbors methods for support vector machines in high dimensional feature spaces	3
Chebyshev center and inscribed balls: properties and calculations	3
Improved DE search for competing groups scheduling with deterioration effects	3
The subdifferential descent method in a nonsmooth variational problem	3
Approximation algorithms for the k-depots Hamiltonian path problem	3
Using regression models to understand the impact of route-length variability in practical vehicle routing	3
A deep reinforcement learning framework for solving two-stage stochastic programs	3
Kernel $$\ell ^1$$-norm principal component analysis for denoising	3
A General Variable Neighborhood Search approach based on a p-median model for cellular manufacturing problems	3
Statistical robustness of two-stage stochastic variational inequalities	3
Models and linearizations for the Traveling Car Renter with Passengers	3
A closed-form bound on the asymptotic linear convergence of iterative methods via fixed point analysis	3
On generalized convex functions and generalized subdifferential II	3
Directional asymptotics of Fejér monotone sequences	3
An efficient bidding heuristic for simultaneous truckload transportation auctions	3
Optimization models for integrated biorefinery operations	3
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program	3
Improved exploitation of higher order smoothness in derivative-free optimization	3
Robustness of solutions to the capacitated facility location problem with uncertain demand	3
Designing an optimal contract mechanism in a cellulosic biofuel enterprise	3
General variable neighborhood search for the parallel machine scheduling problem with two common servers	3
Two-machine flow shop scheduling with convex resource consumption functions	3
Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems	3
The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions	3
Bregman circumcenters: monotonicity and forward weak convergence	3
Siting renewable power generation assets with combinatorial optimisation	3
Finding optimal solutions to several gray pattern instances	3
Log-domain interior-point methods for convex quadratic programming	3
A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces	3
Linear and conic reformulations for the maximum capture location problem under multinomial logit choice	3
Robust Omega ratio optimization using regular vines	3