Maximizing expected utility for stochastic combinatorial optimization problems
Year of publication: |
2019
|
---|---|
Authors: | Li, Jian ; Deshpande, Amol |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 44.2019, 1, p. 354-375
|
Subject: | stochastic shortest path | stochastic knapsack | expected utility theory | Theorie | Theory | Erwartungsnutzen | Expected utility | Stochastischer Prozess | Stochastic process | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem |
-
Robust adaptive routing under uncertainty
Flajolet, Arthur, (2018)
-
Sell or hold : a simple two-stage stochastic combinatorial optimization problem
He, Qie, (2012)
-
Static routing in stochastic scheduling : performance guarantees and asymptotic optimality
Balseiro, Santiago R., (2018)
- More ...
-
Fitting parsimonious household- portfolio models to data
Hubar, Sylwia, (2014)
-
Sun, Hao, (2015)
-
Market fragility and the paradox of the recent stock-bond dissonance
Koulovatianos, Christos, (2017)
- More ...