Solving the bifurcated and nonbifurcated robust network loading problem with k‐adaptive routing

We experiment with an alternative routing scheme for the robust network loading problem with demand uncertainty. Named k‐adaptive, it is based on the fact that the decision‐maker chooses k second‐stage solutions and then commits to one of them only after realization of the uncertainty. This routing...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Networks 2018-07, Vol.72 (1), p.151-170
Hauptverfasser:	Silva, Marco, Poss, Michael, Maculan, Nelson
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive control Bifurcations Computer Science dynamic partition k‐adaptability network loading problem Operations Research polyhedral uncertainty set robust linear optimization Routing routing scheme Uncertainty
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!