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

Mathematics of Operations Research, Vol. 4, No. 1 (Feb., 1979), pp. 60-69 (10 pages) The policy iteration method of dynamic programming is studied in an abstract setting. It is shown to be equivalent ...

MIT, where the popular Julia language was born, has created a probabilistic-programming system called 'Gen', which it says will make it easier for newbies to get started with computer vision, robotics ...