Approximation algorithms for the generalized incremental knapsack problem

Mathematics

• Knapsack Problem 100%
• Knapsack 78%
• Approximation Algorithms 74%
• Profit 49%
• Generalized Assignment Problem 33%
• Capacity Constraints 30%
• Single Machine 26%
• Polynomial Time Approximation Scheme 26%
• Sequencing 25%
• Structural Properties 21%
• Reformulation 21%
• Dynamic Programming 21%
• Enumeration 19%
• Optimal Solution 18%
• Polynomial time 17%
• NP-complete problem 16%
• Non-negative 14%
• Approximation 10%
• Form 8%

Engineering & Materials Science

• Approximation algorithms 92%
• Profitability 75%
• Polynomials 65%
• Structural properties 46%
• Dynamic programming 41%
• NP-hard 41%