Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement).
Lehilton L. C. PedrosaMauro R. C. da SilvaRafael C. S. SchoueryPublished in: LAGOS (2023)
Keyphrases
- knapsack problem
- np hardness
- np hard
- approximation algorithms
- linear programming relaxation
- integrality gap
- worst case analysis
- optimal solution
- exact algorithms
- combinatorial optimization problems
- scheduling problem
- dynamic programming
- special case
- greedy heuristic
- lower bound
- worst case
- optimization problems
- multidimensional knapsack problem
- cutting plane
- computational complexity
- continuous relaxation
- implicit enumeration
- maximum profit
- integer programming
- decision problems
- vehicle routing problem
- greedy algorithm
- evolutionary algorithm
- machine learning