Knapsack problems with position-dependent item weights or profits

DOI10.1007/s10479-023-05265-xMaRDI QIDQ6165391

Stanisław Gawiejnowicz, Nir Halman, Hans Kellerer

Publication date: 31 July 2023

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingknapsack problemapproximation schemes

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models and algorithms of time-dependent scheduling
• Strongly polynomial FPTASes for monotone dynamic programs
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier
• Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs

This page was built for publication: Knapsack problems with position-dependent item weights or profits