Technical Note—An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem

Keyphrases

• Dynamic Programming Algorithm 100%
• Incremental Knapsack Problem 100%
• Adaptive Dynamic Programming 100%
• Approximation Algorithms 33%
• Hardness Results 33%
• Knapsack 33%
• State Space 33%
• Algorithmic Approach 33%
• Polynomial-time Approximation Scheme 33%
• Structural Assumption 33%
• Rounding Method 33%
• Finite Planning Horizon 33%
• Problem Decomposition 33%
• Performance Guarantee 33%
• Dynamic Program 33%
• Counting Argument 33%

Computer Science

• Dynamic Programming 100%
• Knapsack Problem 100%
• Time Approximation Scheme 33%
• Polynomial Time 33%
• State Space 33%
• Approximation Algorithms 33%
• Dynamic Program 33%
• Knapsack 33%
• Performance Guarantee 33%
• Algorithmic Approach 33%
• Planning Horizon 33%