A note on computing the center of uncertain data on the real line
Year of publication: |
May 2016
|
---|---|
Authors: | Wang, Haitao ; Zhang, Jingru ; Zyma, Kenneth |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 44.2016, 3, p. 370-373
|
Subject: | One-center | Uncertain data | Histogram | Lowest point | Upper envelope | Algorithms | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Risiko | Risk | Algorithmus | Algorithm |
-
An algorithm for calculating the set of superhedging portfolios in markets with transaction costs
Löhne, Andreas, (2014)
-
Computing k-centers of uncertain points on a real line
Hu, Ran, (2022)
-
Uncertain Data Envelopment Analysis
Ehrgott, Matthias, (2018)
- More ...
-
What is the best greedy-like heuristic for the weighted set covering problem?
Vasko, Francis J., (2016)
-
Zyma, Kenneth, (2017)
-
Zhang, Jingru, (2016)
- More ...