.png){kind=icon}
返回
The stochastic trim-loss problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.04.042.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The cutting stock problem (CSP) is one of the most fascinating problems in operations research. The problem aims at determining the optimal plan to cut a number of parts of various length from an inventory of standard-size material so to satisfy the customers demands. The deterministic CSP ignores the uncertain nature of the demands thus typically providing recommendations that may result in overproduction or in profit loss. This paper proposes a stochastic version of the CSP which explicitly takes into account uncertainty. Using a scenario-based approach, we develop a two-stage stochastic programming formulation. The highly non-convex nature of the model together with its huge size prevent the application of standard software. We use a solution approach designed to exploit the specific problem structure. Encouraging preliminary computational results are provided. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Stochastic programming
Trim-loss problem
Branch and bound
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Competitor size, male mating success and mate choice in eastern mosquitofish, Gambusia holbrooki
.png){kind=icon}
PREAI
分享收藏
查看更多内容