期刊
ANNALS OF OPERATIONS RESEARCH
卷 284, 期 2, 页码 583-604出版社
SPRINGER
DOI: 10.1007/s10479-017-2689-7
关键词
Partition-based algorithm; Benders decomposition; Two-stage stochastic integer program; Continuous recourse
资金
- National Science Foundation [CMMI 1562245]
In this paper, we propose partition-based decomposition algorithms for solving two-stage stochastic integer program with continuous recourse. The partition-based decomposition method enhance the classical decomposition methods (such as Benders decomposition) by utilizing the inexact cuts (coarse cuts) induced by a scenario partition. Coarse cut generation can be much less expensive than the standard Benders cuts, when the partition size is relatively small compared to the total number of scenarios. We conduct an extensive computational study to illustrate the advantage of the proposed partition-based decomposition algorithms compared with the state-of-the-art approaches.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据