Return
STABILITY ANALYSIS FOR A SPECIAL INTERVAL CUTTING PROBLEM
DOI:10.1016/0377-2217(95)00114-6.png)
Abstract
En 中文
For a special cutting problem we show that it is possible to derive full information about the regions of stability of an optimal solution by a slight modification of a dynamic programming procedure used for solving the unperturbed problem. A simple algorithm for computing the optimal value function of this two-parametric discrete optimization problem will also be given. This algorithm is based on the dynamic programming idea too.
Keywords:
DYNAMIC PROGRAMMING
CUTTING
PARAMETRIC PROGRAMMING
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available

