Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions

Stan van Hoesel, Albert Wagelmans*, Bram Moerman

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

40 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)312-331
Number of pages20
JournalEuropean Journal of Operational Research
Volume75
Issue number2
DOIs
Publication statusPublished - 9 Jun 1994

Fingerprint

Dive into the research topics of 'Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions'. Together they form a unique fingerprint.

Cite this