On the Multistage Shortest Path Problem Under Distributional Uncertainty

In this paper, we consider an ambiguity-averse multistage network game between a user and an attacker . The arc costs are assumed to be random variables that satisfy prescribed first-order moment constraints for some subsets of arcs and individual probability constraints for some particular arcs. Th...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of optimization theory and applications Jg. 197; H. 1; S. 277 - 308
1. Verfasser:	Ketkov, Sergey S.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2023 Springer Nature B.V
Schlagworte:	Applications of Mathematics Calculus of Variations and Optimal Control; Optimization Decisions Electric arcs Engineering Integer programming Linear programming Mathematics Mathematics and Statistics Mixed integer Nodes Operations Research/Decision Theory Optimization Random variables Robustness (mathematics) Shortest-path problems Theory of Computation Shortest path problem Piecewise constant decision rules 90C47 Mixed-integer programming Distributionally robust optimization 90C17 Polyhedral uncertainty 90C27
ISSN:	0022-3239, 1573-2878
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!