Approximation algorithms for the generalized incremental knapsack problem

Keyphrases

• Approximation Algorithms 100%
• Knapsack 100%
• Incremental Knapsack Problem 100%
• Capacity Constraints 33%
• Nondecreasing 33%
• Structural Properties 33%
• Dynamic Programming Algorithm 33%
• Single Machine 33%
• Polynomial Time 33%
• APX-hardness 33%
• Total Profit 33%
• Generalized Assignment Problem 33%
• Strong NP-hardness 33%
• Non-negative Weight 33%
• Knapsack Problem 33%
• Sequencing Problem 33%
• Self-reinforced 33%
• Nearly Optimal Solution 33%
• Quasi-polynomial Time Approximation Scheme 33%
• Period Extension 33%

Computer Science

• Approximation Algorithms 100%
• Knapsack Problem 100%
• Knapsack 75%
• Polynomial Time 50%
• Approximation (Algorithm) 25%
• Capacity Constraint 25%
• Dynamic Programming 25%
• Structural Property 25%
• Assignment Problem 25%
• Time Approximation Scheme 25%
• Programming Technique 25%
• Negative Weight 25%
• Single Machine 25%

Mathematics

• Polynomial Time 100%
• Single Machine 50%
• Structural Property 50%
• Generalized Assignment Problem 50%
• Total Profit 50%