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-11-01 to 2024-11-01.)
ArticleCitations
A class of new modulus-based matrix splitting methods for linear complementarity problem26
Explicit extragradient-like method with adaptive stepsizes for pseudomonotone variational inequalities22
On the unique solution of the generalized absolute value equation22
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 weights18
Closing the gap in linear bilevel optimization: a new valid primal-dual inequality16
A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem16
Modeling the spread of infectious diseases through influence maximization15
Approximation algorithms for the multiprocessor scheduling with submodular penalties13
A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order13
Modeling a flexible staff scheduling problem in the Era of Covid-1912
A new concave minimization algorithm for the absolute value equation solution12
Proximal operator and optimality conditions for ramp loss SVM12
Convergence rates analysis of a multiobjective proximal gradient method12
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming12
Edge metric dimensions via hierarchical product and integer linear programming12
A dynamic programming algorithm for solving the k-Color Shortest Path Problem11
Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping11
A new DIRECT-GLh algorithm for global optimization with hidden constraints11
Minimum budget for misinformation detection in online social networks with provable guarantees10
Resolvent of the parallel composition and the proximity operator of the infimal postcomposition10
Convergence of Lasserre’s hierarchy: the general case10
Practical initialization of the Nelder–Mead method for computationally expensive optimization problems10
Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects10
2DPackLib: a two-dimensional cutting and packing library9
On the Burer–Monteiro method for general semidefinite programs9
Bounds of the solution set of the tensor complementarity problem9
Spatial price equilibrium networks with flow-dependent arc multipliers9
A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations8
QN-tensor and tensor complementarity problem8
Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces8
Complexity of near-optimal robust versions of multilevel optimization problems8
Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data8
Gain-optimized spectral distortions for pronunciation training8
An efficient heuristic for a hub location routing problem8
A resiliency analysis of information distribution policies over mobile ad hoc networks8
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
Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location7
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups7
Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach7
Optimization approach to Berge equilibrium for bimatrix game7
Games with distributionally robust joint chance constraints7
Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance7
On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space7
Strong convergence of inertial subgradient extragradient algorithm for solving pseudomonotone equilibrium problems7
Improved exploitation of higher order smoothness in derivative-free optimization6
Zeroth-order methods for noisy Hölder-gradient functions6
General variable neighborhood search for the parallel machine scheduling problem with two common servers6
On atomic cliques in temporal graphs6
Numerical solution of delay fractional optimal control problems with free terminal time6
On quantitative stability in infinite-dimensional optimization under uncertainty6
Distributionally robust joint chance-constrained support vector machines6
Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates6
A general VNS for the multi-depot open vehicle routing problem with time windows6
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach6
Existence of the least element solution of the vertical block Z-tensor complementarity problem6
A descent extension of a modified Polak–Ribière–Polyak method with application in image restoration problem6
Some notes on the solvability conditions for absolute value equations6
On lattice point counting in $$\varDelta $$-modular polyhedra5
On self-concordant barriers for generalized power cones5
On periodic solution to control problem with time-driven switching5
Commutation principles for optimization problems on spectral sets in Euclidean Jordan algebras5
The single train shortest route problem in a railyard5
A deep reinforcement learning framework for solving two-stage stochastic programs5
On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression5
Statistical robustness of two-stage stochastic variational inequalities5
Minsum scheduling with acceptable lead-times and optional job rejection5
Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits5
Approximating the product knapsack problem5
Analytic solution of the continuous particle swarm optimization problem5
Lower bounds of the solution set of the polynomial complementarity problem5
Computationally efficient approach for solving lexicographic multicriteria optimization problems5
Vehicle routing problem considering equity of demand satisfaction5
An effective version of Schmüdgen’s Positivstellensatz for the hypercube5
The moment-SOS hierarchy and the Christoffel–Darboux kernel5
NPROS: A Not So Pure Random Orthogonal search algorithm—A suite of random optimization algorithms driven by reinforcement learning5
Conditions for linear convergence of the gradient method for non-convex optimization5
Implicit steepest descent algorithm for optimization with orthogonality constraints5
Kernel $$\ell ^1$$-norm principal component analysis for denoising4
Sample average approximations of strongly convex stochastic programs in Hilbert spaces4
A note on the hierarchical multi-switch multi-echelon vehicle routing problem4
Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration4
On the new modulus-based matrix splitting method for linear complementarity problem of $$H_{+}$$-matrix4
A covering traveling salesman problem with profit in the last mile delivery4
A matrix-free trust-region newton algorithm for convex-constrained optimization4
The quasidifferential descent method in a control problem with nonsmooth objective functional4
The multi-depot k-traveling repairman problem4
Unified linear convergence of first-order primal-dual algorithms for saddle point problems4
The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions4
Homogeneous polynomials and spurious local minima on the unit sphere4
On the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization4
A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm4
The assignment problem revisited4
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems4
Expected value based optimal control for discrete-time stochastic noncausal systems4
A block coordinate descent method for sensor network localization4
Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems4
Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem4
Bregman circumcenters: monotonicity and forward weak convergence4
Directional asymptotics of Fejér monotone sequences4
On the exact solution of the multi-depot open vehicle routing problem4
Robustness of solutions to the capacitated facility location problem with uncertain demand4
Using regression models to understand the impact of route-length variability in practical vehicle routing4
Prediction of annual CO2 emissions at the country and sector levels, based on a matrix completion optimization problem3
A General Variable Neighborhood Search approach based on a p-median model for cellular manufacturing problems3
Solving the probabilistic profitable tour problem on a line3
Online NDP-constraint scheduling of jobs with delivery times or weights3
A closed-form bound on the asymptotic linear convergence of iterative methods via fixed point analysis3
Multi-objective home health care routing: a variable neighborhood search method3
Chebyshev center and inscribed balls: properties and calculations3
Douglas–Rachford splitting algorithm for solving state-dependent maximal monotone inclusions3
Optimization models for integrated biorefinery operations3
A note on Anti-Nash equilibrium for bimatrix game3
Linear and conic reformulations for the maximum capture location problem under multinomial logit choice3
Extension of the value function reformulation to multiobjective bilevel optimization3
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program3
A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak3
Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions3
Less is more approach in optimization: a road to artificial intelligence3
Constrained optimization based adversarial example generation for transfer attacks in network intrusion detection systems3
On generalized convex functions and generalized subdifferential II3
Optimal multi-state partnerships for woody biomass co-firing incorporating a demand-response function for biomass procurement3
On the convergence of a class of inertial dynamical systems with Tikhonov regularization3
A robust model for the lot-sizing problem with uncertain demands3
Relating $$\ell _p$$ regularization and reweighted $$\ell _1$$ regularization3
Scheduling with generalized and periodic due dates under single- and two-machine environments3
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
Inverse integer optimization with multiple observations3
Approximation algorithms for the k-depots Hamiltonian path problem3
Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games3
Designing an optimal contract mechanism in a cellulosic biofuel enterprise3
Two-machine flow shop scheduling with convex resource consumption functions3
Feature selection in machine learning via variable neighborhood search3
Mixed-integer linear optimization for full truckload pickup and delivery3
On the solution existence and stability of polynomial optimization problems3
Siting renewable power generation assets with combinatorial optimisation3
The subdifferential descent method in a nonsmooth variational problem3
Finding optimal solutions to several gray pattern instances3
Using neural networks to solve linear bilevel problems with unknown lower level3
A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces3
Parallel memetic algorithm for optimal control of multi-stage catalytic reactions3
Circumcentric directions of cones3
Conveyor operations in distribution centers: modeling and optimization3
On the solution existence to convex polynomial programs and its applications3
Stochastic saddle-point optimization for the Wasserstein barycenter problem2
The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities2
Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models2
Primal-dual incremental gradient method for nonsmooth and convex optimization problems2
An improvement of the Goldstein line search2
A projected splitting method for vertical tensor complementarity problems2
On the approximability of the fixed-tree balanced minimum evolution problem2
Optimization Letters Best Paper Award for 20192
On properties of univariate max functions at local maximizers2
Approximation algorithm for minimum partial multi-cover under a geometric setting2
On an effective approach in shape optimization problem for Stokes equation2
Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds2
On lower and upper bounds for single machine parallel batch scheduling2
Rates of asymptotic regularity for the alternating Halpern–Mann iteration2
Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set2
Sparse regression over clusters: SparClur2
An efficient algorithm for large-scale extended trust-region subproblems with non-intersecting linear constraints2
Economic lot-sizing problem with remanufacturing option: complexity and algorithms2
A neurodynamic approach for joint chance constrained rectangular geometric optimization2
Convergence rate analysis of proximal iteratively reweighted $$\ell _1$$ methods for $$\ell _p$$ regularization problems2
The multilevel facility location and pricing problems: the computational complexity and the stability analysis2
Second order variational analysis of disjunctive constraint sets and its applications to optimization problems2
An inventory model for multiple items assuming time-varying demands and limited storage2
Convergence analysis of the stochastic reflected forward–backward splitting algorithm2
A new polynomially solvable class of quadratic optimization problems with box constraints2
A reduced Jacobian method with full convergence property2
A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem2
General variable neighborhood search for the minimum stretch spanning tree problem2
An approximation algorithm for the submodular multicut problem in trees with linear penalties2
An exact penalty function method for optimal control of a dubins airplane in the presence of moving obstacles2
Decentralized bilevel optimization2
Hybrid variable neighborhood search for automated warehouse scheduling2
Shortest path network problems with stochastic arc weights2
Inverse conic linear programs in Banach spaces2
Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs2
Triply stochastic sequential assignment problem with the uncertainty in worker survival2
Connectedness of the solution sets in generalized semi-infinite set optimization2
A note on overrelaxation in the Sinkhorn algorithm2
A linearized method for solving tensor complementarity problems with implicit Z-tensors2
The leave-worst-k-out criterion for cross validation2
Largest small polygons: a sequential convex optimization approach2
Quantitative inconsistent feasibility for averaged mappings2
A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network2
Duality for convex infinite optimization on linear spaces2
Sparse and risk diversification portfolio selection2
Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming2
An approximation algorithm for the k-level facility location problem with outliers2
Non-dominated solutions for time series learning and forecasting2
Nearly tight approximation algorithm for (connected) Roman dominating set2
On ambiguity-averse market equilibrium2
Connectedness of solution sets for generalized vector equilibrium problems via free-disposal sets in complete metric space2
Regularization of vector equilibrium problems2
Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization2
On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces2
Dual optimal design and the Christoffel–Darboux polynomial2
Tight bounds on Lyapunov rank2
Efficient formulations for the traveling car renter problem and its quota variant2
Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere2
A note on the implications of approximate submodularity in discrete optimization1
Pareto efficiency without topology1
Optimal override policy for chemotherapy scheduling template via mixed-integer linear programming1
Optimal externalities in a parallel transportation network1
Preventive maintenance planning of railway infrastructure by reduced variable neighborhood programming1
Exact solution approaches for a class of bilevel fractional programs1
General variable neighborhood search approach to group steiner tree problem1
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems1
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost1
Wildfire burn scar encapsulation1
Buffered and Reduced Multidimensional Distribution Functions and Their Application in Optimization1
An approximation algorithm for the k-generalized Steiner forest problem1
An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences1
Matching orderable and separable hypergraphs1
A conditional-logic interpretation for Miller–Tucker–Zemlin inequalities and extensions1
On optimal universal first-order methods for minimizing heterogeneous sums1
A discrete competitive facility location model with proportional and binary rules sequentially applied1
Stochastic proximal splitting algorithm for composite minimization1
On refinement strategies for solving $${\textsc {MINLP}\mathrm{s}}$$  by piecewise linear relaxations: a generalized red refinement1
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems1
A maximal-clique-based set-covering approach to overlapping community detection1
Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results1
Nicely structured positive bases with maximal cosine measure1
Optimization of boundary value problems for higher order differential inclusions and duality1
Polyhedral results and stronger Lagrangean bounds for stable spanning trees1
A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model1
A novel one-parameter filled function method with an application to pathological analysis1
Well-posedness for the split equilibrium problem1
A unified analysis of convex and non-convex $$\ell _p$$-ball projection problems1
An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization1
Upper semicontinuity of the solution map to a parametric boundary optimal control problem with unbounded constraint sets1
A local search algorithm for the k-path partition problem1
Bin packing with divisible item sizes and rejection penalties1
An improved algorithm for parallel machine scheduling under additional resource constraints1
A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization1
t-Linearization for the maximum diversity problem1
Dissecting the duality gap: the supporting hyperplane interpretation revisited1
Subdifferentials of convex matrix-valued functions1
A two-phase multi-objective metaheuristic for a green UAV grid routing problem1
Nonsmooth rank-one matrix factorization landscape1
Equilibrium uniqueness in aggregative games: very practical conditions1
Linear convergence rate analysis of proximal generalized ADMM for convex composite programming1
Nested-solution facility location models1
A dual scheme for solving linear countable semi-infinite fractional programming problems1
A Riemannian subspace BFGS trust region method1
Distributionally-robust machine learning using locally differentially-private data1
A computational study on QP problems with general linear constraints1
0.03436803817749