Tuesday, 15:45 - 16:10 h, Room: H 3021


Danny Segev
An approximate dynamic-programming approach to the joint replenishment problem


In this talk, I will present a high-level view of a very recent approach for ε-approximating the joint replenishment problem, with stationary demands and holding costs. Based on synthesizing ideas such as commodity aggregation, approximate dynamic programming, and a few guessing tricks, it turns out that one can attain any required degree of accuracy in time O((nT)O(log log T)), where n denotes the number of given commodities, and T stands for the number of time periods.


Talk 2 of the invited session Tue.3.H 3021
"New insights for old problems" [...]
Cluster 2
"Combinatorial optimization" [...]


  payday loans online. Since its introduction in the market buying Generic Cialis can be exclusively in pharmacy chains with a prescription from a doctor. I agree that this is very inconvenient and takes a lot of time and effort.