Erratum to: "Solving the Mixed-Integer Knapsack Problem by Decrease of Dimension and Use of Dynamic Programming".
Knyaz Sh. MamedovK. K. MamedovS. K. YolchuyevaPublished in: Autom. Control. Comput. Sci. (2016)
Keyphrases
- knapsack problem
- dynamic programming
- continuous relaxation
- mixed integer
- integer variables
- implicit enumeration
- linear program
- randomly generated test instances
- linear programming problems
- optimal solution
- mixed integer program
- cutting plane
- combinatorial optimization problems
- multistage
- quadratic program
- binary variables
- lot sizing
- linear programming
- greedy algorithm
- exact algorithms
- state space
- optimization problems
- feasible solution
- multidimensional knapsack problem
- mixed integer programming
- np hard
- linear programming relaxation
- lp relaxation
- network design problem
- optimal policy
- lagrangian relaxation
- neural network
- integer program
- supply chain
- primal dual
- vehicle routing problem
- combinatorial optimization
- cost function