Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem.
Joseph G. PetersPublished in: Math. Oper. Res. (1988)
Keyphrases
- knapsack problem
- lower bound
- linear programming relaxation
- trade off
- optimal solution
- np hard
- combinatorial optimization problems
- upper bound
- cutting plane
- optimization problems
- exact algorithms
- dynamic programming
- test problems
- maximum profit
- bicriteria
- greedy algorithm
- objective function
- decision variables
- heuristic solution
- continuous relaxation
- multiple objectives
- np hard problems
- multidimensional knapsack problem
- branch and bound
- search algorithm
- reinforcement learning
- bayesian networks
- machine learning