.png){kind=icon}
.png){kind=icon}
Return
USING GEOMETRIC TECHNIQUES TO IMPROVE DYNAMIC-PROGRAMMING ALGORITHMS FOR THE ECONOMIC LOT-SIZING PROBLEM AND EXTENSIONS
.png){kind=icon}
OA
AI
DOI：10.1016/0377-2217(94)90077-9.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we discuss two basic geometric techniques that can be used to speed up certain types of dynamic programs. We first present the algorithms in a general form, and then we show how these techniques can be applied to the economic lot-sizing problem and extensions. Furthermore, it is illustrated that the geometric techniques can be used to give elegant and insightful proofs of structural results, like Wagner and Whitin's planning horizon theorem. Finally, we present results of computational experiments in which new algorithms for the economic lot-sizing problem are compared with each other, as well as with other algorithms from the literature.
Keywords:
DYNAMIC PROGRAMMING
COMPUTATIONAL ANALYSIS
LOT-SIZING
INVENTORY
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