Solving the mixed-integer knapsack problem by decrease of dimension and use of dynamic programming.
Knyaz Sh. MamedovK. K. MamedovS. K. ElchuevaPublished in: Autom. Control. Comput. Sci. (2015)
Keyphrases
- knapsack problem
- dynamic programming
- continuous relaxation
- mixed integer
- integer variables
- implicit enumeration
- linear program
- optimal solution
- linear programming problems
- randomly generated test instances
- quadratic program
- mixed integer program
- cutting plane
- combinatorial optimization problems
- linear programming
- multidimensional knapsack problem
- binary variables
- feasible solution
- greedy algorithm
- lp relaxation
- state space
- linear programming relaxation
- multistage
- exact algorithms
- convex hull
- mixed integer programming
- integer program
- lot sizing
- reinforcement learning
- lagrangian relaxation
- quadratic programming
- column generation
- optimal policy
- optimization problems
- evolutionary algorithm