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) ...
https://doi.org/10.2307/2581283 • https://www.jstor.org/stable/2581283 Copy URL A preference order dynamic programming model proposed in the literature for solving ...
一些您可能无法访问的结果已被隐去。
显示无法访问的结果
反馈