1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.OC2024
On feasibility cuts for chance-constrained multicommodity network design problems
Niels A. Wouda, Ward Romeijnders, Evrim Ursavas
Problem definition: We study efficient exact solution approaches to solve chance-constrained multicommodity network design problems under demand uncertainty, an important class of…
math.OC2022★ 1 cited
Pragmatic distributionally robust optimization for simple integer recourse models
E. Ruben van Beesten, Ward Romeijnders, David P. Morton
Inspired by its success for their continuous counterparts, the standard approach to deal with mixed-integer recourse (MIR) models under distributional uncertainty is to use distrib…