An iterative dynamic programming approach for the temporal knapsack problem

François Clautiaux,Boris Detienne, Gaël Guillot

European Journal of Operational Research（2021）

引用 16|浏览1

暂无评分

摘要

•We address the Temporal Knapsack Problem.•We propose a solution method based on Successive Sublimation Dynamic Programming algorithm.•Numerical experiments show that this original algorithm is competitive with the state of the art.

查看译文

关键词

Temporal knapsack,Exact algorithm,Lagrangian relaxation,Successive sublimation dynamic programming method

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要