Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty
Open Journal of Mathematical Optimization · 2023
DOI: 10.5802/ojmo.23 ↗At a glance
Journal article in Open Journal of Mathematical Optimization, 2023. Written by Hande Yaman. Cited 3 times so far (Crossref); 10 references.
Abstract (original language)
In this paper, we consider a robust combinatorial optimization problem with uncertain weights and propose an uncertainty set that generalizes interval uncertainty by imposing lower and upper bounds on deviations of subsets of items. We prove that if the number of such subsets is fixed and the family of these subsets is laminar, then the robust combinatorial optimization problem can be solved by solving a fixed number of nominal problems. This result generalizes a previous similar result for the case where the family of these subsets is a partition of the set of items.
Cite
APA
Yaman, H. (2023). Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty. Open Journal of Mathematical Optimization. https://doi.org/10.5802/ojmo.23
Vancouver
Yaman H. Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty. Open Journal of Mathematical Optimization. 2023. doi:10.5802/ojmo.23
BibTeX
@article{Yaman2023,
author = {Yaman, Hande},
title = {Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty},
journal = {Open Journal of Mathematical Optimization},
year = {2023},
doi = {10.5802/ojmo.23}
}
EUVIMED