.png){kind=icon}
返回
Partition-based decomposition algorithms for two-stage Stochastic integer programs with continuous recourse
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-017-2689-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Partition-based algorithm
Benders decomposition
Two-stage stochastic integer program
Continuous recourse
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
Isolation and characterization of a human colon adenocarcinoma cell line resistant to doxorubicin
OAAI
.png){kind=icon}
OAAI分享收藏分享收藏
查看更多内容