Computational Results: Algorithms for Robust Combinatorial Optimization with Budgeted Uncertainty
Zenodo (CERN European Organization for Nuclear Research)
Abstract
We provide computational results for robust combinatorial optimization problems with budgeted uncertainty described in the thesis "Algorithms for Robust Combinatorial Optimization with Budgeted Uncertainty and Fair Planning of the Out-of-Hours Service for Pharmacies" by Timo Gersing.
Authors 1
-
Affiliation as printed
RWTH Aachen University
Cited by 0 stored of 0
No patents citing this paper on Lens.org (checked 2026-10-06).