3 papers
math.OC2026
Variable Smoothing for Weakly Convex Problems with Non-Euclidean Directions
Farid Najar
We propose MELMO (Moreau Envelope Smoothing with Linear Minimization Oracles), an algorithm for composite optimization problems of the form min x f (x) + g(T x), where f is smooth…
cs.LG2026
Demand Acceptance using Reinforcement Learning for Dynamic Vehicle Routing Problem with Emission Quota
Farid Najar, Dominique Barth, Yann Strozecki
This paper introduces and formalizes the Dynamic and Stochastic Vehicle Routing Problem with Emission Quota (DS-QVRP-RR), a novel routing problems that integrates dynamic demand ac…
cs.DS2025
Demand Selection for VRP with Emission Quota
Farid Najar, Dominique Barth, Yann Strozecki
Combinatorial optimization (CO) problems are traditionally addressed using Operations Research (OR) methods, including metaheuristics. In this study, we introduce a demand selectio…