We present an Approximate Dynamic Programming (ADP) approach for the multidimensional knapsack problem (MKP). We approximate the value function (a) using parametric and nonparametric methods and (b) ...

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, ...

We introduce a novel approach to solving dynamic programming problems, such as those in many economic models, on a quantum annealer, a specialized device that performs combinatorial optimization.

Dynamic optimization and optimal control problems form the backbone of numerous applications in engineering, economics and the natural sciences. These methodologies involve determining a time-varying ...