Optimization Letters

Papers
(The median citation count of Optimization Letters is 1. 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-07-01 to 2024-07-01.)
ArticleCitations
The Big-M method with the numerical infinite M51
On the convergence rate of the Halpern-iteration22
Explicit extragradient-like method with adaptive stepsizes for pseudomonotone variational inequalities22
A class of new modulus-based matrix splitting methods for linear complementarity problem21
On the unique solution of the generalized absolute value equation20
Personnel scheduling during Covid-19 pandemic19
Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints18
Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights17
A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem16
The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects15
Closing the gap in linear bilevel optimization: a new valid primal-dual inequality14
A note on partial calmness for bilevel optimization problems with linearly structured lower level14
Approximation algorithms for the multiprocessor scheduling with submodular penalties13
Mathematical optimization approach for facility layout on several rows13
Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem12
A new concave minimization algorithm for the absolute value equation solution12
Modeling the spread of infectious diseases through influence maximization12
A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order12
Proximal operator and optimality conditions for ramp loss SVM11
Convergence rates analysis of a multiobjective proximal gradient method11
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming11
A new DIRECT-GLh algorithm for global optimization with hidden constraints11
Modeling a flexible staff scheduling problem in the Era of Covid-1911
Edge metric dimensions via hierarchical product and integer linear programming11
Minimum budget for misinformation detection in online social networks with provable guarantees10
A dynamic programming algorithm for solving the k-Color Shortest Path Problem10
Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping9
Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects9
Resolvent of the parallel composition and the proximity operator of the infimal postcomposition9
On the Burer–Monteiro method for general semidefinite programs9
Gain-optimized spectral distortions for pronunciation training8
Bounds of the solution set of the tensor complementarity problem8
Spatial price equilibrium networks with flow-dependent arc multipliers8
Existence and generic stability conditions of equilibrium points to controlled systems for n-player multiobjective generalized games using the Kakutani–Fan–Glicksberg fixed-point theorem8
Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces8
Practical initialization of the Nelder–Mead method for computationally expensive optimization problems8
Green supply chain design with emission sensitive demand: second order cone programming formulation and case study8
Convergence of Lasserre’s hierarchy: the general case8
Online algorithms for the mixed ring loading problem with two nodes7
Complexity of near-optimal robust versions of multilevel optimization problems7
QN-tensor and tensor complementarity problem7
Games with distributionally robust joint chance constraints7
Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach7
2DPackLib: a two-dimensional cutting and packing library7
Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance7
A resiliency analysis of information distribution policies over mobile ad hoc networks7
Two-Bar Charts Packing Problem7
On the convergence of algorithms with Tikhonov regularization terms7
A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations7
An efficient heuristic for a hub location routing problem7
Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location7
Strong convergence of inertial subgradient extragradient algorithm for solving pseudomonotone equilibrium problems7
Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data6
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups6
Zeroth-order methods for noisy Hölder-gradient functions6
Analytic solution of the continuous particle swarm optimization problem6
On quantitative stability in infinite-dimensional optimization under uncertainty6
A parallel variable neighborhood search for solving covering salesman problem6
On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space6
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach6
Implicit steepest descent algorithm for optimization with orthogonality constraints5
Improved exploitation of higher order smoothness in derivative-free optimization5
On lattice point counting in $$\varDelta $$-modular polyhedra5
Vehicle routing problem considering equity of demand satisfaction5
On periodic solution to control problem with time-driven switching5
Improved analysis of spectral algorithm for clustering5
Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates5
Strong Karush–Kuhn–Tucker optimality conditions for weak efficiency in constrained multiobjective programming problems in terms of mordukhovich subdifferentials5
Optimization approach to Berge equilibrium for bimatrix game5
Greedy approximation for the minimum connected dominating set with labeling5
Existence of the least element solution of the vertical block Z-tensor complementarity problem5
Distributionally robust joint chance-constrained support vector machines5
Minsum scheduling with acceptable lead-times and optional job rejection5
Approximating the product knapsack problem5
Numerical solution of delay fractional optimal control problems with free terminal time5
A deep reinforcement learning framework for solving two-stage stochastic programs5
Computationally efficient approach for solving lexicographic multicriteria optimization problems5
General variable neighborhood search for the parallel machine scheduling problem with two common servers5
Unified linear convergence of first-order primal-dual algorithms for saddle point problems5
A descent extension of a modified Polak–Ribière–Polyak method with application in image restoration problem5
Strong convergence theorems for inertial Tseng’s extragradient method for solving variational inequality problems and fixed point problems5
Commutation principles for optimization problems on spectral sets in Euclidean Jordan algebras5
Some notes on the solvability conditions for absolute value equations5
Directional asymptotics of Fejér monotone sequences4
The assignment problem revisited4
Lower bounds of the solution set of the polynomial complementarity problem4
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems4
On the computational complexity of uncapacitated multi-plant lot-sizing problems4
The multi-depot k-traveling repairman problem4
An effective version of Schmüdgen’s Positivstellensatz for the hypercube4
On the new modulus-based matrix splitting method for linear complementarity problem of $$H_{+}$$-matrix4
On the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization4
A covering traveling salesman problem with profit in the last mile delivery4
Using regression models to understand the impact of route-length variability in practical vehicle routing4
A matrix-free trust-region newton algorithm for convex-constrained optimization4
The quasidifferential descent method in a control problem with nonsmooth objective functional4
On solving the order processing in picking workstations4
Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem4
Sample average approximations of strongly convex stochastic programs in Hilbert spaces4
The moment-SOS hierarchy and the Christoffel–Darboux kernel4
Improved lower bound on the dimension of the EU council’s voting rules4
The single train shortest route problem in a railyard4
On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression4
Expected value based optimal control for discrete-time stochastic noncausal systems4
Homogeneous polynomials and spurious local minima on the unit sphere4
On self-concordant barriers for generalized power cones4
Bregman circumcenters: monotonicity and forward weak convergence3
Siting renewable power generation assets with combinatorial optimisation3
Chebyshev center and inscribed balls: properties and calculations3
Finding optimal solutions to several gray pattern instances3
Log-domain interior-point methods for convex quadratic programming3
A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights3
Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games3
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program3
Inverse integer optimization with multiple observations3
Kernel $$\ell ^1$$-norm principal component analysis for denoising3
Less is more approach in optimization: a road to artificial intelligence3
A General Variable Neighborhood Search approach based on a p-median model for cellular manufacturing problems3
Efficient nearest neighbors methods for support vector machines in high dimensional feature spaces3
Optimal multi-state partnerships for woody biomass co-firing incorporating a demand-response function for biomass procurement3
NPROS: A Not So Pure Random Orthogonal search algorithm—A suite of random optimization algorithms driven by reinforcement learning3
Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration3
Conditions for linear convergence of the gradient method for non-convex optimization3
The subdifferential descent method in a nonsmooth variational problem3
A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces3
Robustness of solutions to the capacitated facility location problem with uncertain demand3
A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak3
Approximation algorithms for the k-depots Hamiltonian path problem3
Statistical robustness of two-stage stochastic variational inequalities3
Designing an optimal contract mechanism in a cellulosic biofuel enterprise3
On atomic cliques in temporal graphs3
A note on the hierarchical multi-switch multi-echelon vehicle routing problem3
A closed-form bound on the asymptotic linear convergence of iterative methods via fixed point analysis3
A best possible online algorithm for parallel batch scheduling with delivery times and limited restart3
On the convergence of a class of inertial dynamical systems with Tikhonov regularization3
Douglas–Rachford splitting algorithm for solving state-dependent maximal monotone inclusions3
Optimization models for integrated biorefinery operations3
Linear and conic reformulations for the maximum capture location problem under multinomial logit choice3
A general VNS for the multi-depot open vehicle routing problem with time windows3
Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems3
Robust Omega ratio optimization using regular vines3
Two-machine flow shop scheduling with convex resource consumption functions3
Constrained optimization based adversarial example generation for transfer attacks in network intrusion detection systems3
On generalized convex functions and generalized subdifferential II3
The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions3
A note on semi-infinite program bounding methods2
Duality for convex infinite optimization on linear spaces2
Stochastic saddle-point optimization for the Wasserstein barycenter problem2
On ambiguity-averse market equilibrium2
Efficient formulations for the traveling car renter problem and its quota variant2
A robust model for the lot-sizing problem with uncertain demands2
Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs2
A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm2
On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces2
Prediction of annual CO2 emissions at the country and sector levels, based on a matrix completion optimization problem2
Shortest path network problems with stochastic arc weights2
Parallel memetic algorithm for optimal control of multi-stage catalytic reactions2
Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions2
The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities2
Solving the probabilistic profitable tour problem on a line2
Relating $$\ell _p$$ regularization and reweighted $$\ell _1$$ regularization2
Approximation algorithm for minimum partial multi-cover under a geometric setting2
A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem2
A fully stochastic primal-dual algorithm2
Circumcentric directions of cones2
Iterated local search for the generalized independent set problem2
FPTAS for barrier covering problem with equal touching circles in 2D2
Rates of asymptotic regularity for the alternating Halpern–Mann iteration2
Dual optimal design and the Christoffel–Darboux polynomial2
Non-dominated solutions for time series learning and forecasting2
Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere2
Online NDP-constraint scheduling of jobs with delivery times or weights2
A neurodynamic approach for joint chance constrained rectangular geometric optimization2
A linearized method for solving tensor complementarity problems with implicit Z-tensors2
Regularization of vector equilibrium problems2
The multilevel facility location and pricing problems: the computational complexity and the stability analysis2
On lower and upper bounds for single machine parallel batch scheduling2
New projection methods for equilibrium problems over fixed point sets2
Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set2
Largest small polygons: a sequential convex optimization approach2
Tight bounds on Lyapunov rank2
Second order variational analysis of disjunctive constraint sets and its applications to optimization problems2
The leave-worst-k-out criterion for cross validation2
Nearly tight approximation algorithm for (connected) Roman dominating set2
Triply stochastic sequential assignment problem with the uncertainty in worker survival2
An approximation algorithm for the k-level facility location problem with outliers2
An improvement of the Goldstein line search2
Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization2
A note on Anti-Nash equilibrium for bimatrix game2
Inverse conic linear programs in Banach spaces2
Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits2
Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming2
On the solution existence and stability of polynomial optimization problems2
On properties of univariate max functions at local maximizers2
Sparse regression over clusters: SparClur2
Variable neighborhood programming for symbolic regression2
Scheduling with generalized and periodic due dates under single- and two-machine environments2
Connectedness of the solution sets in generalized semi-infinite set optimization2
A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network2
On the solution existence to convex polynomial programs and its applications2
Conveyor operations in distribution centers: modeling and optimization2
A block coordinate descent method for sensor network localization2
A note on overrelaxation in the Sinkhorn algorithm2
An efficient algorithm for large-scale extended trust-region subproblems with non-intersecting linear constraints2
General variable neighborhood search for the minimum stretch spanning tree problem2
Quantitative inconsistent feasibility for averaged mappings2
Primal-dual incremental gradient method for nonsmooth and convex optimization problems2
Using neural networks to solve linear bilevel problems with unknown lower level2
Mixed-integer linear optimization for full truckload pickup and delivery2
On the approximability of the fixed-tree balanced minimum evolution problem2
Multi-objective home health care routing: a variable neighborhood search method2
A new polynomially solvable class of quadratic optimization problems with box constraints2
Existence results for a dynamic Sturm–Liouville boundary value problem on time scales2
Equilibrium uniqueness in aggregative games: very practical conditions1
An approximation algorithm for the k-generalized Steiner forest problem1
Two-machine flow shop with dynamic storage space1
Pareto efficiency without topology1
Bin packing with divisible item sizes and rejection penalties1
An improved algorithm for parallel machine scheduling under additional resource constraints1
On refinement strategies for solving $${\textsc {MINLP}\mathrm{s}}$$  by piecewise linear relaxations: a generalized red refinement1
Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results1
Feature selection in machine learning via variable neighborhood search1
Matching orderable and separable hypergraphs1
Optimal externalities in a parallel transportation network1
Polyhedral results and stronger Lagrangean bounds for stable spanning trees1
Wildfire burn scar encapsulation1
Linear convergence rate analysis of proximal generalized ADMM for convex composite programming1
A Riemannian subspace BFGS trust region method1
On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane $${\mathbb {R}}^2$$1
Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models1
A characterization of weighted simple games based on pseudoweightings1
An approximation algorithm for the submodular multicut problem in trees with linear penalties1
An inventory model for multiple items assuming time-varying demands and limited storage1
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems1
General variable neighborhood search approach to group steiner tree problem1
Optimization of boundary value problems for higher order differential inclusions and duality1
Maximization of a PSD quadratic form and factorization1
On using cardinality constrained uncertainty for objective coefficients in robust optimization1
Nested-solution facility location models1
An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences1
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems1
On optimal universal first-order methods for minimizing heterogeneous sums1
A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization1
Stochastic proximal splitting algorithm for composite minimization1
Optimal override policy for chemotherapy scheduling template via mixed-integer linear programming1
Preventive maintenance planning of railway infrastructure by reduced variable neighborhood programming1
On an effective approach in shape optimization problem for Stokes equation1
A unified analysis of convex and non-convex $$\ell _p$$-ball projection problems1
Nonsmooth rank-one matrix factorization landscape1
Subdifferentials of convex matrix-valued functions1
0.67845702171326