The complexity of knapsack problems in wreath products.
Michael FigeliusMoses GanardiMarkus LohreyGeorg ZetzschePublished in: CoRR (2020)
Keyphrases
- knapsack problem
- exact algorithms
- combinatorial optimization problems
- np hard
- optimization problems
- test problems
- dynamic programming
- worst case
- bicriteria
- linear programming relaxation
- greedy algorithm
- optimal solution
- production planning
- decision problems
- cost function
- cutting plane
- multi objective
- binary variables
- greedy algorithms
- reinforcement learning
- np hard problems