.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Partition-based algorithm
Benders decomposition
Two-stage stochastic integer program
Continuous recourse
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
Cited Papers
Isolation and characterization of a human colon adenocarcinoma cell line resistant to doxorubicin
OAAI
.png){kind=icon}
OAAIShareSaveShareSaveShareSave
View more