.png){kind=icon}
返回
A heuristic procedure for stochastic integer programs with complete recourse
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2004.09.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a successive approximation heuristic which solves large stochastic mixed-integer programming problem with complete fixed recourse. We refer to this method as the Scenario Updating Method, since it solves the problem by considering only a subset of scenarios which is updated at each iteration. Only those scenarios which imply a significant change in the objective function are added. The algorithm is terminated when no such scenarios are available to enter in the current scenario subtree. Several rules to select scenarios are discussed. Bounds on heuristic solutions are computed by relaxing some of the non-anticipativity constraints. The proposed procedure is tested on a multistage stochastic batch-sizing problem. (c) 2004 Published by Elsevier B.V.
Keyword:
heuristic algorithm
successive approximation
stochastic integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容