Investment vs. reward in a competitive knapsack problem.
Oren NeumannClaudius GrosPublished in: CoRR (2021)
Keyphrases
- knapsack problem
- long run
- combinatorial optimization problems
- optimal solution
- dynamic programming
- optimization problems
- test problems
- exact algorithms
- np hard
- greedy algorithm
- continuous relaxation
- bicriteria
- decision making
- multidimensional knapsack problem
- heuristic solution
- reinforcement learning
- competitive market
- decision variables
- multiple objectives
- cutting plane
- cost function
- genetic algorithm
- simulated annealing
- lp relaxation
- greedy heuristic
- scheduling problem
- np hard problems
- maximum profit