Many interesting combinatorial problems can be optimized efficiently using recursive computations often termed discrete dynamic programming. In this paper, we develop a paradigm for a general class of ...

This is a preview. Log in through your library . Abstract We study a deterministic maritime inventory routing problem with a long planning horizon. For instances with many ports and many vessels, ...