A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Decomposition methods for hard optimization problems
1. Verfasser:	Taghavi, Majid (VerfasserIn)
Weitere Verfasser:	Huang, Kai (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2020
Schlagworte:	Capacity expansion > Scenario tree > Multi-stage stochastic integer programming > Lagrangian relaxation > Network flow > Spot market > Permanent capacity > Aufsatz im Buch
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
Random sampling and machine learning to understand good decompositions	2020	Basso, S.
Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse	2020	Pay, Babak Saleck
Preface: decompostion methods for hard optimization problems	2020	Furini, Fabio
A branch-and-cut algorithm for the maximum covering cycle problem	2020	Álvarez-Miranda, Eduardo
An accelerated L-shaped method for solving two-stage stochastic programs in disaster management	2020	Graß, Emilia
A Benders decomposition approach to product location in carousel storage systems	2020	Vickson, Raymond G.
A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints	2020	Taghavi, Majid
Price-and-verify : a new algorithm for recursive circle packing using Dantzig–Wolfe decomposition	2020	Gleixner, Ambros M.
Improving set partitioning problem solutions by zooming around an improving direction	2020	Zaghrouti, Abdelouahab