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 This paper elaborates a method of attack on traveling-salesman problems, proposed by the authors in an earlier paper, in which linear ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...