Optimization Letters
A biased random-key genetic algorithm for the Steiner triple covering problem
A breakpoint search approach for convex resource allocation problems with bounded variables
A general method for enclosing solutions of interval linear equations
A note on single-machine scheduling with nonlinear deterioration
Boundary control of non-well-posed elliptic equations with nonlinear Neumann boundary conditions
Discretization orders for distance geometry problems
Dynamic guiding particle swarm optimization with embedded chaotic search for solving multidimensional problems
Exact and heuristic approaches for the set cover with pairs problem
Lipschitzian stability of parametric variational inequalities over perturbed polyhedral convex sets
On the volumetric path
Optimization framework for process scheduling of operation-dependent automobile assembly lines
Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
Pareto–Fenchel $${\epsilon}$$ -subdifferential sum rule and $${\epsilon}$$ -efficiency
Sensitivity and stability for the second-order contingent derivative of the proper perturbation map in vector optimization
SOR- and Jacobi-type iterative methods for solving l 1 - l 2 problems by way of Fenchel duality
Strong convergence of a proximal point algorithm with general errors
Three kinds of convexity and concavity properties of optimal value function in parametric nonlinear programming