Binary knapsack problems with random budgets.
Shubhabrata DasDiptesh GhoshPublished in: J. Oper. Res. Soc. (2003)
Keyphrases
- knapsack problem
- binary variables
- combinatorial optimization problems
- test problems
- dynamic programming
- optimal solution
- optimization problems
- exact algorithms
- production planning
- np hard
- greedy algorithm
- np hard problems
- cutting plane
- greedy algorithms
- linear programming relaxation
- non binary
- continuous relaxation
- hamming distance
- upper bound
- machine learning
- lower bound
- cost function
- maximum profit