Reducing the 0-1 Knapsack Problem with a Single Continuous Variable to the Standard 0-1 Knapsack Problem.
Marcel BütherDirk BriskornPublished in: Int. J. Oper. Res. Inf. Syst. (2012)
Keyphrases
- knapsack problem
- continuous variables
- optimal solution
- combinatorial optimization problems
- dynamic programming
- continuous relaxation
- optimization problems
- np hard
- multidimensional knapsack problem
- mixed integer
- linear programming relaxation
- exact algorithms
- dynamic systems
- greedy algorithm
- integer variables
- computationally expensive
- bayesian networks
- state space
- search algorithm
- implicit enumeration