2 papers
math.OC2022
An oracle-based framework for robust combinatorial optimization
Enrico Bettiol, Christoph Buchheim, Marianna De Santis +1
We propose a general solution approach for min-max-robust counterparts of combinatorial optimization problems with uncertain linear objectives. We focus on the discrete scenario ca…
math.OC2017
A simplicial decomposition framework for large scale convex quadratic programming
Enrico Bettiol, Lucas Létocart, Francesco Rinaldi +1
In this paper, we analyze in depth a simplicial decomposition like algorithmic framework for large scale convex quadratic programming. In particular, we first propose two tailored…