A multi-stage stochastic programming approach for network capacity expansion with multiple sources of capacity

DOI10.1002/nav.21726zbMath1411.90242arXiv1511.01922OpenAlexW2272243826MaRDI QIDQ4632947

Kai Huang, Majid Taghavi

Publication date: 2 May 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.01922

zbMATH Keywords

approximation algorithmscenario treecapacity expansioncontractspot marketbenders decompositionmulti-stage stochastic integer programming

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15) Stochastic network models in operations research (90B15)

Related Items (5)

Polynomial-time algorithms for single resource stochastic capacity expansion models with lost sales ⋮ Supplier selection problem for multiple projects with uncertain demand and project life cycles ⋮ Decision rule-based method in solving adjustable robust capacity expansion problem ⋮ A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints ⋮ A multi-stage stochastic integer programming approach for locating electric vehicle charging stations

This page was built for publication: A multi-stage stochastic programming approach for network capacity expansion with multiple sources of capacity