| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Accelerated variance-reduced methods for saddle-point problems
|
Borodich, Ekaterina
|
|
|
10 |
C |
p.
|
article
|
| 2 |
A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty
|
Gu, Hanyu
|
|
|
10 |
C |
p.
|
article
|
| 3 |
A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem
|
Avolio, Matteo
|
|
|
10 |
C |
p.
|
article
|
| 4 |
A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: Total tardiness minimization
|
G.-de-Alba, Héctor
|
|
|
10 |
C |
p.
|
article
|
| 5 |
A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression
|
Chan–Renous-Legoubin, Rémi
|
|
|
10 |
C |
p.
|
article
|
| 6 |
An optimisation model for minimising changes in frequency allocations
|
Beasley, J.E.
|
|
|
10 |
C |
p.
|
article
|
| 7 |
A reinforcement learning approach to the stochastic cutting stock problem
|
Pitombeira-Neto, Anselmo R.
|
|
|
10 |
C |
p.
|
article
|
| 8 |
A simplified convergence theory for Byzantine resilient stochastic gradient descent
|
Roberts, Lindon
|
|
|
10 |
C |
p.
|
article
|
| 9 |
Celebrating 20 years of EUROpt
|
Anjos, Miguel F.
|
|
|
10 |
C |
p.
|
article
|
| 10 |
Chance-constrained optimization under limited distributional information: A review of reformulations based on sampling and distributional robustness
|
Küçükyavuz, Simge
|
|
|
10 |
C |
p.
|
article
|
| 11 |
Decentralized personalized federated learning: Lower bounds and optimal algorithm for all personalization modes
|
Sadiev, Abdurakhmon
|
|
|
10 |
C |
p.
|
article
|
| 12 |
Direct nonlinear acceleration
|
Dutta, Aritra
|
|
|
10 |
C |
p.
|
article
|
| 13 |
Editorial Board
|
|
|
|
10 |
C |
p.
|
article
|
| 14 |
EUROpt, the Continuous Optimization Working Group of EURO: From idea to maturity
|
Illés, Tibor
|
|
|
10 |
C |
p.
|
article
|
| 15 |
Exponential extrapolation memory for tabu search
|
Bentsen, Håkon
|
|
|
10 |
C |
p.
|
article
|
| 16 |
Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization
|
Neumann, Christoph
|
|
|
10 |
C |
p.
|
article
|
| 17 |
Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization
|
Dvurechensky, Pavel
|
|
|
10 |
C |
p.
|
article
|
| 18 |
Multi-Neighborhood simulated annealing for the minimum interference frequency assignment problem
|
Ceschia, Sara
|
|
|
10 |
C |
p.
|
article
|
| 19 |
New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
|
Schmidt, Jeanette
|
|
|
10 |
C |
p.
|
article
|
| 20 |
Newton-MR: Inexact Newton Method with minimum residual sub-problem solver
|
Roosta, Fred
|
|
|
10 |
C |
p.
|
article
|
| 21 |
Performance comparison of two recently proposed copositivity tests
|
Peng, Bo
|
|
|
10 |
C |
p.
|
article
|
| 22 |
Progress in mathematical programming solvers from 2001 to 2020
|
Koch, Thorsten
|
|
|
10 |
C |
p.
|
article
|
| 23 |
Robot Dance: A mathematical optimization platform for intervention against COVID-19 in a complex network
|
Nonato, Luis Gustavo
|
|
|
10 |
C |
p.
|
article
|
| 24 |
Sustainable two stage supply chain management: A quadratic optimization approach with a quadratic constraint
|
Caramia, Massimiliano
|
|
|
10 |
C |
p.
|
article
|
| 25 |
The Marguerite Frank Award for the best EJCO paper 2021
|
Bomze, Immanuel
|
|
|
10 |
C |
p.
|
article
|
| 26 |
Training very large scale nonlinear SVMs using Alternating Direction Method of Multipliers coupled with the Hierarchically Semi-Separable kernel approximations
|
Cipolla, S.
|
|
|
10 |
C |
p.
|
article
|
| 27 |
Trust-region algorithms: Probabilistic complexity and intrinsic noise with applications to subsampling techniques
|
Bellavia, S.
|
|
|
10 |
C |
p.
|
article
|
| 28 |
Twenty years of EUROPT, the EURO working group on Continuous Optimization
|
Cafieri, Sonia
|
|
|
10 |
C |
p.
|
article
|
| 29 |
Upper and lower bounds based on linear programming for the b-coloring problem
|
Montemanni, Roberto
|
|
|
10 |
C |
p.
|
article
|
Journal description